Registrer deg | Logg på | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

yaldings algorithm [14 articles]

Artikler nylig sendt til yaldings bibliotek klassifisert med nøkkelordet algorithm. You can also see everyone's algorithm.
  • On the Complexity of Processing Massive, Unordered, Distributed Data
    (22 May 2007)
    by Jon Feldman, S Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, Zoya Svitkina
    posted to algorithm distributed stream by yalding on 2008-01-27 22:12:30 as ****
  • Scheduling Algorithms for Procrastinators
    (14 Aug 2007)
    by Michael A Bender, Raphael Clifford, Kostas Tsichlas
    posted to algorithm scheduling by yalding on 2007-08-31 04:17:24 as *** along with 1 person mwmarkland
  • Approximate graph coloring by semidefinite programming
    J. ACM, Vol. 45, No. 2. (March 1998), pp. 246-265.
    by David Karger, Rajeev Motwani, Madhu Sudan
    posted to algorithm approximation coloring sdp by yalding on 2007-06-14 10:01:17 as ***** along with 1 person and 4 groups euclid Algorithms metric_embeddings TCS Polytopes
  • Stable distributions, pseudorandom generators, embeddings, and data stream computation
    J. ACM, Vol. 53, No. 3. (May 2006), pp. 307-323.
    by Piotr Indyk
    posted to algorithm embedding stream by yalding on 2007-05-15 08:11:31 as **** along with 3 people ansobol asterix77 Operator
  • Budget Optimization in Search-Based Advertising Auctions
    (8 Dec 2006)
    by Jon Feldman, S Muthukrishnan, Martin Pal, Cliff Stein
    posted to algorithm auction game random search by yalding on 2007-03-09 15:02:20 as ***
  • Fourier meets M\
    (21 Nov 2006)
    by Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
    posted to algorithm fft stoc by yalding on 2007-02-21 08:19:59 as ** along with 2 people proportional TooMuchCoffeeMan
  • Online Conflict-Free Coloring for Intervals
    SIAM Journal on Computing, Vol. 36, No. 5. (2006), pp. 1342-1359.
    by Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jiri Matoušek, Elchanan Mossel, Janos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
    posted to geometry coloring approximation algorithm by yalding on 2007-02-01 15:32:36 as **
  • Randomized incremental construction of abstract Voronoi diagrams
    Comput. Geom. Theory Appl., Vol. 3, No. 3. (August 1993), pp. 157-184.
    by Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    posted to algorithm geometry voronoi by yalding on 2006-09-22 07:26:20 as ****
  • Data Streams: Algorithms and Applications
    posted to algorithm stream by yalding on 2006-06-23 12:25:46 as **
  • Computing Betti numbers via combinatorial Laplacians
    (1996), pp. 386-391.
    by Joel Friedman
    posted to algorithm eigen by yalding on 2005-10-04 15:48:52 as read along with 1 person ansobol
  • Approximation algorithms for geometric shortest path problems
    (2000), pp. 286-295.
    by Lyudmil Aleksandrov, Anil Maheshwari, J&\#246;rg-R&\#252;diger Sack
    posted to algorithm approximation geometry optimization by yalding on 2005-08-20 08:22:02 as ** along with 1 person ansobol
  • The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
    (16 Aug 2005)
    by Josiah Carlson, David Eppstein
    posted to algorithm optimization tree by yalding on 2005-08-18 04:37:25 as **
  • Restricted delaunay triangulations and normal cycle
    (2003), pp. 312-321.
    by David Cohen-Steiner, Jean-Marie Morvan
    posted to algorithm delaunay surface triangulation by yalding on 2005-08-04 07:06:17 as **
  • Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
    (2003), pp. 329-337.
    by Joachim Giesen, Uli Wagner
    posted to geometry algorithm computational detection dimension by yalding on 2005-02-24 06:30:06 as read along with 1 person gane5h
    • NB: Du kan sitere denne siden som: http://www.citeulike.org/user/yalding/tag/algorithm

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.