新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

abie library [51 articles]

最近 abie さんのライブラリ .
  • The primes contain arbitrarily long arithmetic progressions
    (9 Feb 2006)
    by Ben Green, Terence Tao
    posted to major-breakthrough by abie on 2007-07-20 17:11:06 as ** along with 1 person madhurt
  • First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction
    Internet and Network Economics (2006), pp. 99-111.
    by Abraham Flaxman, David Gamarnik, Gregory Sorkin
    posted to auction first-passage path percolation vcg by abie on 2007-07-20 17:10:23 as read
  • Randomly coloring sparse random graphs with fewer colors than the maximum degree
    Random Struct. Algorithms, Vol. 29, No. 4. (December 2006), pp. 450-465.
    by Martin Dyer, Abraham D Flaxman, Alan M Frieze, Eric Vigoda
    posted to no-tag by abie on 2007-06-05 20:01:06 as read
  • On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    (2005), pp. 441-449.
    by Abraham D Flaxman, Alan M Frieze, Juan C Vera
    posted to analysis average case facility geometric graphs location np-hard optimization random by abie on 2007-06-05 02:27:33 as read
  • Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
    STACS 2005 (2005), pp. 305-314.
    by Abraham D Flaxman, Bartosz Przydatek
    posted to analysis average case instances random subset sum by abie on 2007-05-23 23:56:36 as read
  • A Geometric Preferential Attachment Model of Networks
    Algorithms and Models for the Web-Graph (2004), pp. 44-55.
    by Abraham D Flaxman, Alan M Frieze, Juan Vera
    posted to attachment diameter geometric law power preferential by abie on 2007-05-23 23:53:04 as read
  • Online convex optimization in the bandit setting: gradient descent without a gradient
    (2005), pp. 385-394.
    by Abraham D Flaxman, Adam T Kalai, Brendan H Mcmahan
    posted to and approximation convex descent exploit explore gradient online optimization perturbation simultaneous stochastic by abie on 2007-05-22 23:29:09 as read along with 2 people neddimitrov hrishi
  • Graph Visualization and Navigation in Information Visualization: A Survey
    IEEE Transactions on Visualization and Computer Graphics, Vol. 6, No. 1. (\slash 2000), pp. 24-43.
    by Herman, G Melan\ccon, MS Marshall
    posted to drawing graph by abie on 2007-05-22 17:03:07 as **** along with 14 people and 4 groups ansobol mapio nkorf josefs morningboat yijisoo krisjack onyx douglasfcalvert AndyDent jwong mamader bazilio cmschweda Semantic-Social-Networks infovis DSS mobilecomputing
  • Adversarial deletion in a scale free random graph process
    (2005), pp. 287-292.
    by Abraham D Flaxman, Alan M Frieze, Juan Vera
    posted to adversarial attachment deletion free graph preferential random scale by abie on 2007-05-19 00:11:16 as read
  • notes The Diameter of Randomly Perturbed Digraphs and Some Applications
    Approximation, Randomization, and Combinatorial Optimization (2004), pp. 345-356.
    by Abraham D Flaxman, Alan M Frieze
    posted to algorithm analysis diameter digraphs graphs log perturbed randomly smoothed space by abie on 2007-05-17 15:37:16 as read
  • notes On the random 2-stage minimum spanning tree
    Random Structures and Algorithms, Vol. 28, No. 1. (2006), pp. 24-36.
    by Abraham D Flaxman, Alan Frieze, Michael Krivelevich
    posted to minimum programming random spanning stage stochastic tree two by abie on 2007-05-17 15:30:11 as read
  • On Graph Problems in a Semi-streaming Model
    Automata, Languages and Programming (2004), pp. 531-543.
    by Joan Feigenbaum, Sampath Kannan, Andrew Mcgregor, Siddharth Suri, Jian Zhang
    posted to algorithm bound diameter lower semi-streaming streaming by abie on 2007-05-16 22:41:48 as read along with 1 person boila
  • The Diameter of Randomly Perturbed Digraphs and Some Applications
    by Abraham D Flaxman, Alan M Frieze
    posted to algorithm analysis diameter digraphs graphs log perturbed randomly smoothed space by abie on 2007-05-16 19:52:22 as read
  • Embracing the giant component
    Random Structures and Algorithms, Vol. 27, No. 3. (2005), pp. 277-289.
    by Abraham D Flaxman, David Gamarnik, Gregory B Sorkin
    posted to achlioptas algorithms component giant graphs online process random threshold by abie on 2007-05-16 19:43:12 as read
  • Efficient communication in an ad-hoc network
    Journal of Algorithms, Vol. 52, No. 1. (July 2004), pp. 1-7.
    by Abraham Flaxman, Alan Frieze, Eli Upfal
    posted to ad-hoc algorithm communication dust geometric graph random by abie on 2007-05-14 18:09:50 as read
  • Numerical evaluation of the upper critical dimension of percolation in scale-free networks
    (10 May 2007)
    by Zhenhua Wu, Cecilia Lagorio, Lidia A Braunstein, Reuven Cohen, Shlomo Havlin, Eugene H Stanley
    posted to critical degree distribution free law percolation power scale threshold by abie on 2007-05-14 18:07:44 as **
  • A sharp threshold for a random constraint satisfaction problem
    Discrete Mathematics, Vol. 285, No. 1-3. (6 August 2004), pp. 301-305.
    by Abraham D Flaxman
    posted to csp random structures by abie on 2007-05-11 23:15:25 as read
  • A sharp threshold for a random constraint satisfaction problem
    Discrete Math., Vol. 285, No. 1-3. (2004), pp. 301-305.
    by Abraham D Flaxman
    posted to csp k-sat random satisfiability by abie on 2007-05-11 23:13:28 as read
  • Efficient communication in an ad-hoc network
    J. Algorithms, Vol. 52, No. 1. (2004), pp. 1-7.
    by Abraham Flaxman, Alan Frieze, Eli Upfal
    posted to ad-hoc communication dust network networks sensor smart by abie on 2007-05-11 23:11:05 as read
  • Strings with maximally many distinct subsequences and substrings
    Electron. J. Combin., Vol. 11, No. 1. (2004)
    by Abraham Flaxman, Aram W Harrow, Gregory B Sorkin
    posted to distinct factors sequences string subsequence substring substrings by abie on 2007-05-11 23:08:24 as read
  • High degree vertices and eigenvalues in the preferential attachment graph
    Internet Math., Vol. 2, No. 1. (2005), pp. 1-19.
    by Abraham Flaxman, Alan Frieze, Trevor Fenner
    posted to albert attachment barabasi degree eigenvalue graph maximum model preferential random spectral by abie on 2007-05-11 23:01:41 as read
  • A spectral technique for random satisfiable 3CNF formulas
    (2003), pp. 357-363.
    by Abraham Flaxman
    posted to 3 algorithm random sat satisfiability spectral by abie on 2007-05-11 22:48:08 as read
  • Data streams: algorithms and applications
    Found. Trends Theor. Comput. Sci., Vol. 1, No. 2. (August 2005), pp. 117-236.
    by S Muthukrishnan
    posted to streaming by abie on 2007-05-11 19:24:08 as ***** along with 2 people donade burtonwu
  • The space complexity of approximating the frequency moments
    (1996), pp. 20-29.
    by Noga Alon, Yossi Matias, Mario Szegedy
    posted to streaming by abie on 2007-05-11 19:07:01 as read along with 5 people ChaTo donade mangesh gimbiri burtonwu
  • Splitting digraphs
    Combin. Probab. Comput., Vol. 15, No. 6. (2006), pp. 933-937.
    by Noga Alon
    posted to decompositions graph graphs pertubed randomly by abie on 2007-05-10 19:10:08 as *****
  • Randomly coloring sparse random graphs with fewer colors than the maximum degree
    Random Structures Algorithms, Vol. 29, No. 4. (2006), pp. 450-465.
    by Martin Dyer, Abraham D Flaxman, Alan M Frieze, Eric Vigoda
    posted to coloring by abie on 2007-05-10 19:06:13 as read
  • SybilGuard: defending against sybil attacks via social networks
    (2006), pp. 267-278.
    by Haifeng Yu, Michael Kaminsky, Phillip B Gibbons, Abraham Flaxman
    posted to no-tag by abie on 2007-05-10 18:51:05 as read along with 13 people elsantosneto ChaTo matteodellamico p2p-sec donade henningpeters HailunTan eduardomoschetta mook3000 tnhh dquercia mmcgloho pedagand
  • Online convex optimization in the bandit setting: gradient descent without a gradient
    (2 Aug 2004)
    by Abraham D Flaxman, Adam T Kalai, Brendan H Mcmahan
    posted to no-tag by abie on 2007-05-10 18:50:34 as read along with 1 person gagliol
  • Finding a large hidden clique in a random graph
    Random Structures Algorithms, Vol. 13, No. 3-4. (1998), pp. 457-466.
    by Noga Alon, Michael Krivelevich, Benny Sudakov
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • A spectral technique for coloring random $3$-colorable graphs
    SIAM J. Comput., Vol. 26, No. 6. (1997), pp. 1733-1748.
    by Noga Alon, Nabil Kahale
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • Decreasing the diameter of bounded degree graphs
    J. Graph Theory, Vol. 35, No. 3. (2000), pp. 161-172.
    by Noga Alon, András Gyárfás, Miklós Ruszinkó
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • Eigenvalues and expanders
    Combinatorica, Vol. 6, No. 2. (1986), pp. 83-96.
    by N Alon
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as read
  • Random walks, universal traversal sequences, and the complexity of maze problems
    (1979), pp. 218-223.
    by Romas Aleliunas, Richard M Karp, Richard J Lipton, László Lovász, Charles Rackoff
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • Linear Upper Bounds for Random Walk on Small Density Random 3-CNF
    (2003)
    by Mikhail Alekhnovich, Eli B Sasson
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • More on average case vs approximation complexity
    (2003), pp. 298-307.
    by Michael Alekhnovich
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • The objective method: probabilistic combinatorial optimization and local weak convergence
    Vol. 110 (2004), pp. 1-72.
    by David J Aldous, Michael J Steele
    posted to bibtex-import by abie on 2007-05-09 22:48:07 as *****
  • Calculating waterfowl abundance on the basis of banding returns
    (1930)
    by Frederick C Lincoln
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • On routes and multicast trees in the Internet
    SIGCOMM Comput. Commun. Rev., Vol. 28, No. 1. (1998), pp. 41-50.
    by Jean J Pansiot, Dominique Grad
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • The internet AS-level topology: three data sources and one definitive metric
    SIGCOMM Comput. Commun. Rev., Vol. 36, No. 1. (2006), pp. 17-26.
    by Priya Mahadevan, Dmitri Krioukov, Marina Fomenkov, Xenofontas Dimitropoulos, Claffy, Amin Vahdat
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • The origin of power laws in Internet topologies revisited
    Vol. 2 (2002), pp. 608-617.
    by Qian Chen, Hyunseok Chang, R Govindan, S Jamin, Scott J Shenker, Walter Willinger
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • Internet Tomography
    Nature (January 1999)
    by Claffy, TE Monk, D Mcrobb
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • Exploration of scale-free networks
    European Physical Journal B, Vol. 38 (2004), pp. 201-204.
    by T Petermann, De Los
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • On unbiased sampling for unstructured peer-to-peer networks
    (2006), pp. 27-40.
    by Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, Walter Willinger
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • Probabilities in proofreading
    Amer. Math. Monthly, Vol. 83, No. 1. (1975)
    by George Pólya
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • A Survey of Statistical Methods for Graph Analysis
    Sociological Methodology, Vol. 12 (1981), pp. 110-155.
    by Ove Frank
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • The Small World (in honor of Stanley Milgram)
    (1989)
    by Alden S Klovdahl
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • Sampling and estimation in hidden populations using respondent-drive sampling
    Sociological Methodology, Vol. 34 (2004)
    by Matthew J Salganik, Douglas D Heckathorn
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • A note on probabilities in proofreading
    Amer. Math. Monthly, Vol. 95, No. 9. (1988)
    by Fa S Liu
    posted to bibtex-import by abie on 2007-05-09 22:46:53 as **
  • Self-similar Scale-free Networks and Disassortativity
    (8 Jul 2005)
    by Soon-Hyung Yook, Filippo Radicchi, Hildegard Meyer-Ortmanns
    posted to no-tag by abie on 2007-05-09 22:41:00 as ** along with 3 people and 2 groups A_Olympia ChaTo MaineC Philosophy_of_Information Blog_and_Wiki_Research
  • The number of matchings in random graphs
    Journal of Statistical Mechanics: Theory and Experiment, Vol. 2006, No. 05. (May 2006), P05003.
    by Lenka Zdeborová, Marc Mézard
    posted to no-tag by abie on 2007-05-09 19:52:37 as **
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/abie

    Result page: 1 2 Next 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.