Wed, 20 Aug 2008 21:21:49 BST CiteULike: mapio's library [114 articles] http://www.citeulike.org/user/mapio CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/mapio/article/2972292 <i>Comb. Probab. Comput., Vol. 13, No. 4-5. (2004), pp. 577-625.</i> Boltzmann Samplers for the Random Generation of Combinatorial Structures Philippe Duchon Philippe Flajolet Guy Louchard Gilles Schaeffer doi:10.1017/S0963548304006315 Comb. Probab. Comput., Vol. 13, No. 4-5. (2004), pp. 577-625. 2008-07-08T10:38:48-00:00 2004 Comb. Probab. Comput. 0963-5483 13 4-5 577 625 Cambridge University Press alg comb rndalg sampling http://www.citeulike.org/user/mapio/article/113848 <i>(20 December 2002)</i><br /><br />The long-anticipated revision of this best-selling book offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence. Intelligent Agents. Solving Problems by Searching. Informed Search Methods. Game Playing. Agents that Reason Logically. First-order Logic. Building a Knowledge Base. Inference in First-Order Logic. Logical Reasoning Systems. Practical Planning. Planning and Acting. Uncertainty. Probabilistic Reasoning Systems. Making Simple Decisions. Making Complex Decisions. Learning from Observations. Learning with Neural Networks. Reinforcement Learning. Knowledge in Learning. Agents that Communicate. Practical Communication in English. Perception. Robotics. For those interested in artificial intelligence. Artificial Intelligence: A Modern Approach (2nd Edition) Stuart Russell Peter Norvig (20 December 2002) 2005-03-04T08:43:21-00:00 2002 Prentice Hall ai stat http://www.citeulike.org/user/mapio/article/2815332 <i>(17 May 2008)</i><br /><br />Let F(x,y) be a function of two variables, and suppose y = f(x) satisfies F(x,y)=0 in some range. Then dy/dx = -Fx/Fy, where Fx and Fy denote the partial derivatives of F with respect to x and y. It is natural to seek a general expression for the higher derivatives d^ny/dx^n, in terms of partial derivatives of F, and such an expression was given in 1974 by L. Comtet and M. Fiolet. Their formula, however, contains some errors. In this note, we give a corrected expression. We give a derivation using Lagrange inversion and also an elementary proof by induction. We further correct a minor error in Comtet and Fiolet's expression for the number of terms in their formula. Implicit higher derivatives, and a formula of Comtet and Fiolet Tom Wilde (17 May 2008) 2008-05-20T08:21:35-00:00 2008 math http://www.citeulike.org/user/mapio/article/2812170 <i></i> My Ten Favorite "Practical Theory" Papers Jennifer Rexford 2008-05-19T07:48:52-00:00 no-tag http://www.citeulike.org/user/mapio/article/2812160 <i>(2000)</i><br /><br />Introduction To motivate this survey, we begin with a simple problem that demonstrates a powerful fundamental idea. Suppose that n balls are thrown into n bins, with each ball choosing a bin independently and uniformly at random. Then the maximum load, or the largest number of balls in any bin, is approximately log n/ log log n with high probability. Now suppose instead that the balls are placed sequentially, and each ball is placed in the least loaded of d >= 2 bins chosen independently and... The power of two random choices: A survey of the techniques and results M Mitzenmacher A Richa R Sitaraman (2000) 2008-05-19T07:40:58-00:00 2000 prob reference rndalg survey http://www.citeulike.org/user/mapio/article/2543855 <i>ACM Letters on Programming Languages and Systems, Vol. 2, No. 1-4. (March--December 1993), pp. 59-69.</i><br /><br />this paper, we have described a representation suitable for sets with a fixed-size universe. The representation supports constant-time implementations of clear-set, member, add-member, delete-member, cardinality, and choose-one. Based on the efficiency of these operations, the new representation will often be superior to alternatives such as bit vectors, balanced binary trees, hash tables, linked lists, etc. Additionally, the new representation supports enumeration of the members in O(n) time, ... An Efficient Representation for Sparse Sets Preston Briggs Linda Torczon ACM Letters on Programming Languages and Systems, Vol. 2, No. 1-4. (March--December 1993), pp. 59-69. 2008-03-16T22:00:15-00:00 1993 ACM Letters on Programming Languages and Systems 2 1-4 59 69 ACM Press datastructure programming http://www.citeulike.org/user/mapio/article/1660512 <i>(01 May 2002)</i><br /><br />Science is inextricably linked with mathematics. Statistician David Salsburg examines the development of ever-more-powerful statistical methods for determining scientific truth in <I>The Lady Tasting Tea</I>, a series of historical and biographical sketches that illuminate without alienating the mathematically timid. Salsburg, who has worked in academia and industry and has met many of the major players he writes about, shares his subjects' enthusiasm for problem solving and deep thinking. His sense of excitement drives the prose, but never at the expense of the reader; if anything, the author has taken pains to eliminate esoterica and ephemera from his stories. This might frustrate a few number-head readers, but the abundant notes and references should keep them happy in the library for weeks after reading the book.<p> Ultimately, the various tales herein are unified in a single theme: the conversion of science from observational natural history into rigorously defined statistical models of data collection and analysis. This process, usually only implicit in studies of scientific methods and history, is especially important now that we seem to be reaching the point of diminishing returns and are looking for new paradigms of scientific investigation. <I>The Lady Tasting Tea</I> will appeal to a broad audience of scientifically literate readers, reminding them of the humanity underlying the work. <I>--Rob Lightner</I> At a summer tea party in Cambridge, England, a guest states that tea poured into milk tastes different from milk poured into tea. Her notion is shouted down by the scientific minds of the group. But one man, Ronald Fisher, proposes to scientifically test the hypothesis. There is no better person to conduct such an experiment, for Fisher is a pioneer in the field of statistics. The Lady Tasting Tea spotlights not only Fishers theories but also the revolutionary ideas of dozens of men and women which affect our modern everyday lives. Writing with verve and wit, David Salsburg traces breakthroughs ranging from the rise and fall of Karl Pearsons theories to the methods of quality control that rebuilt postwar Japans economy, including a pivotal early study on the capacity of a small beer cask at the Guinness brewing factory. Brimming with intriguing tidbits and colorful characters, The Lady Tasting Tea salutes the spirit of those who dared to look at the world in a new way. The Lady Tasting Tea: How Statistics Revolutionized Science in the Twentieth Century David Salsburg (01 May 2002) 2007-09-15T11:09:21-00:00 2002 Owl Books book reference stat http://www.citeulike.org/user/mapio/article/381085 <i>(18 August 2001)</i><br /><br />This is the book that made "innumeracy" a household word, at least in some households. Paulos admits that "at least part of the motivation for any book is anger, and this book is no exception. I'm distressed by a society which depends so completely on mathematics and science and yet seems to indifferent to the innumeracy and scientific illiteracy of so many of its citizens."<p> But that is not all that drives him. The difference between our pretensions and reality is absurd and humorous, and the numerate can see this better than those who don't speak math. "I think there's something of the divine in these feelings of our absurdity, and they should be cherished, not avoided."<p> Paulos is not entirely successful at balancing anger and absurdity, but he tries. His diatribes against astrology, bad math education, Freud, and willful ignorance are leavened with jokes, mathematical or the sort (he claims) favored by the numerate.<p> It remains to be seen if <I>Innumeracy</I> will indeed be able, as Hofstadter hoped, to "help launch a revolution in math education that would do for innumeracy what Sabin and Salk did for polio"--but many of the improvements Paulos suggested have come to pass within 10 years. Only time will tell if the generation raised on these new principles is more resistant to innumeracy--and need only worry about being incomputable. <I>--Mary Ellen Curtin</I> <div>Why do even well-educated people understand so little about mathematics? And what are the costs of our innumeracy? John Allen Paulos, in his celebrated bestseller first published in 1988, argues that our inability to deal rationally with very large numbers and the probabilities associated with them results in misinformed governmental policies, confused personal decisions, and an increased susceptibility to pseudoscience of all kinds. Innumeracy lets us know what we're missing, and how we can do something about it.<br><br>Sprinkling his discussion of numbers and probabilities with quirky stories and anecdotes, Paulos ranges freely over many aspects of modern life, from contested elections to sports stats, from stock scams and newspaper psychics to diet and medical claims, sex discrimination, insurance, lotteries, and drug testing. Readers of <i>Innumeracy </i>will be rewarded with scores of astonishing facts, a fistful of powerful ideas, and, most important, a clearer, more quantitative way of looking at their world.<br></div> Innumeracy: Mathematical Illiteracy and Its Consequences John Paulos (18 August 2001) 2005-11-04T22:04:47-00:00 2001 Hill and Wang book math reference stat http://www.citeulike.org/user/mapio/article/1698471 <i>(07 December 1993)</i><br /><br />"There is terror in numbers," writes Darrell Huff in <I>How to Lie with Statistics</I>. And nowhere does this terror translate to blind acceptance of authority more than in the slippery world of averages, correlations, graphs, and trends. Huff sought to break through "the daze that follows the collision of statistics with the human mind" with this slim volume, first published in 1954. The book remains relevant as a wake-up call for people unaccustomed to examining the endless flow of numbers pouring from Wall Street, Madison Avenue, and everywhere else someone has an axe to grind, a point to prove, or a product to sell. "The secret language of statistics, so appealing in a fact-minded culture, is employed to sensationalize, inflate, confuse, and oversimplify," warns Huff.<p> Although many of the examples used in the book are charmingly dated, the cautions are timeless. Statistics are rife with opportunities for misuse, from "gee-whiz graphs" that add nonexistent drama to trends, to "results" detached from their method and meaning, to statistics' ultimate bugaboo--faulty cause-and-effect reasoning. Huff's tone is tolerant and amused, but no-nonsense. Like a lecturing father, he expects you to learn something useful from the book, and start applying it every day. Never be a sucker again, he cries!<p> <blockquote>Even if you can't find a source of demonstrable bias, allow yourself some degree of skepticism about the results as long as there is a possibility of bias somewhere. There always is.</blockquote><p> Read <I>How to Lie with Statistics</I>. Whether you encounter statistics at work, at school, or in advertising, you'll remember its simple lessons. Don't be terrorized by numbers, Huff implores. "The fact is that, despite its mathematical base, statistics is as much an art as it is a science." <I>--Therese Littleton</I> How to Lie With Statistics Darrell Huff (07 December 1993) 2007-09-26T22:34:22-00:00 1993 W. W. Norton & Company book reference stat http://www.citeulike.org/user/mapio/article/2329676 <i>(1996), pp. 310-318.</i> An empirical study of smoothing techniques for language modeling Stanley Chen Joshua Goodman doi:10.3115/981863.981904 (1996), pp. 310-318. 2008-02-04T14:54:22-00:00 1996 310 318 Association for Computational Linguistics ngram http://www.citeulike.org/user/mapio/article/444767 <i>Computer, Vol. 31, No. 3. (1998), pp. 23-30.</i><br /><br />A fundamental change is occurring in the way people write computer programs, away from system programming languages such as C or C++ to scripting languages such as Perl or Tcl. Although many people are participating in the change, few realize that the change is occurring and even fewer know why it is happening. This article explains why scripting languages will handle many of the programming tasks in the next century better than system programming languages. System programming languages were designed for building data structures and algorithms from scratch, starting from the most primitive computer elements. Scripting languages are designed for gluing. They assume the existence of a set of powerful components and are intended primarily for connecting components Scripting: higher level programming for the 21st Century JK Ousterhout doi:10.1109/2.660187 Computer, Vol. 31, No. 3. (1998), pp. 23-30. 2005-12-19T18:55:17-00:00 1998 Computer 31 3 23 30 programming teaching http://www.citeulike.org/user/mapio/article/1941826 <i>(19 Nov 2007)</i><br /><br />We analyze linkage strategies for a set I of webpages for which the webmaster wants to maximize the sum of Google's PageRank scores. The webmaster can only choose the hyperlinks starting from the webpages of I and has no control on the hyperlinks from other webpages. We provide an optimal linkage strategy under some reasonable assumptions. Maximizing PageRank via outlinks Cristobald de Kerchove Laure Ninove Paul Van Dooren (19 Nov 2007) 2007-11-20T06:56:31-00:00 2007 pagerank http://www.citeulike.org/user/mapio/article/379517 <i>(1997), pp. 1157-1166.</i> Syntactic clustering of the Web Andrei Broder Steven Glassman Mark Manasse Geoffrey Zweig doi:10.1016/S0169-7552(97)00031-7 (1997), pp. 1157-1166. 2005-11-03T16:46:20-00:00 1997 0169-7552 1157 1166 Elsevier Science Publishers Ltd. dupurl webir http://www.citeulike.org/user/mapio/article/1286305 <i>(2007), pp. 111-120.</i> Do not crawl in the dust: different urls with similar text Ziv Bar-Yossef Idit Keidar Uri Schonfeld doi:10.1145/1242572.1242588 (2007), pp. 111-120. 2007-05-09T20:03:07-00:00 2007 111 120 ACM Press dupurl webir http://www.citeulike.org/user/mapio/article/1183207 <i>Computers and the Humanities, Vol. 40, No. 2. (May 2006), pp. 153-174.</i> From the field to the web: implementing best-practice recommendations in documentary linguistics Boas Hans doi:10.1007/s10579-006-9012-6 Computers and the Humanities, Vol. 40, No. 2. (May 2006), pp. 153-174. 2007-03-24T15:37:16-00:00 2006 Computers and the Humanities 1574-020X 40 2 153 174 Springer dh http://www.citeulike.org/user/mapio/article/1906688 <i></i> Burrows: Numbering the Streaks of the Tulip? 2007-11-13T09:51:54-00:00 dh http://www.citeulike.org/user/mapio/article/1902312 <i>The American Mathematical Monthly, Vol. 102, No. 7. (1995), pp. 600-608.</i> How to Write a Proof Leslie Lamport The American Mathematical Monthly, Vol. 102, No. 7. (1995), pp. 600-608. 2007-11-12T10:28:48-00:00 1995 The American Mathematical Monthly 102 7 600 608 reference scientficwriting http://www.citeulike.org/user/mapio/article/1902306 <i>Notices of the AMS (December 2007)</i> How to Write Your First Paper Steven Krantz Notices of the AMS (December 2007) 2007-11-12T10:26:29-00:00 2007 Notices of the AMS reference scientficwriting http://www.citeulike.org/user/mapio/article/1378954 <i>(1998), pp. 327-336.</i> Min-wise independent permutations (extended abstract) Andrei Broder Moses Charikar Alan Frieze Michael Mitzenmacher doi:10.1145/276698.276781 (1998), pp. 327-336. 2007-06-11T16:25:15-00:00 1998 327 336 ACM Press alg prob rndalg http://www.citeulike.org/user/mapio/article/1402085 <i>(4 Dec 2006)</i><br /><br />The choice of the PageRank damping factor is not evident. The Google's choice for the value c=0.85 was a compromise between the true reflection of the Web structure and numerical efficiency. However, the Markov random walk on the original Web Graph does not reflect the importance of the pages because it absorbs in dead ends. Thus, the damping factor is needed not only for speeding up the computations but also for establishing a fair ranking of pages. In this paper, we propose new criteria for choosing the damping factor, based on the ergodic structure of the Web Graph and probability flows. Specifically, we require that the core component receives a fair share of the PageRank mass. Using singular perturbation approach we conclude that the value c=0.85 is too high and suggest that the damping factor should be chosen around 1/2. As a by-product, we describe the ergodic structure of the OUT component of the Web Graph in detail. Our analytical results are confirmed by experiments on two large samples of the Web Graph. A singular perturbation approach for choosing PageRank damping factor Konstantin Avrachenkov Nelly Litvak Kim Pham (4 Dec 2006) 2007-06-21T09:50:04-00:00 2006 linkanalysis nnmc pagerank http://www.citeulike.org/user/mapio/article/1423738 <i>Information Theory, IEEE Transactions on, Vol. 44, No. 6. (1998), pp. 2178-2206.</i><br /><br />Classical and recent results in statistical pattern recognition and learning theory are reviewed in a two-class pattern classification setting. This basic model best illustrates intuition and analysis techniques while still containing the essential features and serving as a prototype for many applications. Topics discussed include nearest neighbor, kernel, and histogram methods, Vapnik-Chervonenkis theory, and neural networks. The presentation and the large (though nonexhaustive) list of references is geared to provide a useful overview of this field for both specialists and nonspecialists Learning pattern classification-a survey SR Kulkarni G Lugosi SS Venkatesh Information Theory, IEEE Transactions on, Vol. 44, No. 6. (1998), pp. 2178-2206. 2007-06-29T22:09:49-00:00 1998 Information Theory, IEEE Transactions on 44 6 2178 2206 learning prob stat http://www.citeulike.org/user/mapio/article/1423736 <i>Advanced Lectures on Machine Learning (2004), pp. 169-207.</i><br /><br />The goal of statistical learning theory is to study, in a statistical framework, the properties of learning algorithms. In particular, most results take the form of so-called error bounds. This tutorial introduces the techniques that are used to obtain such results. Introduction to Statistical Learning Theory Olivier Bousquet Stéphane Boucheron Gábor Lugosi Advanced Lectures on Machine Learning (2004), pp. 169-207. 2007-06-29T22:08:34-00:00 2004 Advanced Lectures on Machine Learning 169 207 learning prob stat http://www.citeulike.org/user/mapio/article/1111001 <i>(2003), pp. 89-98.</i> Information-theoretic co-clustering Inderjit Dhillon Subramanyam Mallela Dharmendra Modha doi:10.1145/956750.956764 (2003), pp. 89-98. 2007-02-18T04:41:09-00:00 2003 89 98 ACM Press clustering ir http://www.citeulike.org/user/mapio/article/912649 <i>J. ACM, Vol. 51, No. 3. (May 2004), pp. 497-515.</i> On clusterings: Good, bad and spectral Ravi Kannan Santosh Vempala Adrian Vetta doi:10.1145/990308.990313 J. ACM, Vol. 51, No. 3. (May 2004), pp. 497-515. 2006-10-25T19:13:43-00:00 2004 J. ACM 0004-5411 51 3 497 515 ACM Press clustering ir http://www.citeulike.org/user/mapio/article/1026107 <i>ACM Trans. Database Syst., Vol. 31, No. 4. (December 2006), pp. 1499-1525.</i> A divide-and-merge methodology for clustering David Cheng Ravi Kannan Santosh Vempala Grant Wang doi:10.1145/1189769.1189779 ACM Trans. Database Syst., Vol. 31, No. 4. (December 2006), pp. 1499-1525. 2007-01-05T02:30:25-00:00 2006 ACM Trans. Database Syst. 0362-5915 31 4 1499 1525 ACM Press clustering ir http://www.citeulike.org/user/mapio/article/1404182 <i>ACM Comput. Surv., Vol. 39, No. 1. (2007)</i> Compressed full-text indexes Gonzalo Navarro Veli Makinen doi:10.1145/1216370.1216372 ACM Comput. Surv., Vol. 39, No. 1. (2007) 2007-06-22T07:55:48-00:00 2007 ACM Comput. Surv. 0360-0300 39 1 ACM Press alg ir survey http://www.citeulike.org/user/mapio/article/1211806 <i>(2004), pp. 202-211.</i> Visibly pushdown languages Rajeev Alur P Madhusudan doi:10.1145/1007352.1007390 (2004), pp. 202-211. 2007-04-06T10:11:51-00:00 2004 202 211 ACM Press nwvpa http://www.citeulike.org/user/mapio/article/1365799 <i>(2005), pp. 277-286.</i> Isomorphism and embedding problems for infinite limits of scale-free graphs Robert Kleinberg Jon Kleinberg (2005), pp. 277-286. 2007-06-05T15:45:51-00:00 2005 277 286 Society for Industrial and Applied Mathematics prob readme webgraph http://www.citeulike.org/user/mapio/article/1319172 <i></i><br /><br />this paper. 3. ALGORITHM Our motivation is to provide a duplicate detection algorithm that can scale to the size of the web and handle the short documents typically seen there. Furthermore, we seek to place each document in only one set of potential duplicates. The degree of similarity supported should be sufficiently loose to identify non-exact matches but tight enough to assure that true duplicates are detected. Last, the approaches and algorithms discussed here are addressed to finding ACM ... Collection Statistics for Fast Duplicate Document Abdur 2007-05-22T10:57:35-00:00 alg ir webir http://www.citeulike.org/user/mapio/article/221026 <i>IEEE Transactions on Visualization and Computer Graphics, Vol. 6, No. 1. (ash 2000), pp. 24-43.</i><br /><br />This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, state--transition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different... Graph Visualization and Navigation in Information Visualization: A Survey Herman G Melan\ccon MS Marshall IEEE Transactions on Visualization and Computer Graphics, Vol. 6, No. 1. (ash 2000), pp. 24-43. 2005-06-06T20:15:53-00:00 2000 IEEE Transactions on Visualization and Computer Graphics 6 1 24 43 graphdrawing readme webgraph http://www.citeulike.org/user/mapio/article/1264753 <i>European Journal of Physics, Vol. 28, No. 3. (May 2007), pp. L17-L25.</i> How do numbers begin? (The first digit law) Torres Fernandez Gamero Sola doi:10.1088/0143-0807/28/3/N04 European Journal of Physics, Vol. 28, No. 3. (May 2007), pp. L17-L25. 2007-04-29T10:02:54-00:00 2007 European Journal of Physics 0143-0807 28 3 L17 L25 Institute of Physics Publishing stat tharg http://www.citeulike.org/user/mapio/article/828013 <i>Random Structures and Algorithms, Vol. 29, No. 3. (2006), pp. 257-276.</i><br /><br />We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we consider are subgraphs induced by a random subset of vertices, each vertex included independently with probability p, and subgraphs generated as a random subset of edges, each edge with probability p.Let n denote the number of vertices, choose p ? (0, 1) possibly depending on n, and let b = 1/(1 - p). We show that in both random models, for any weighted graph G, there is a set of edges Q of cardinality O(n logbn) that contains the minimum spanning tree of a random subgraph of G with high probability. This result is asymptotically optimal. As a consequence, we also give a bound of O(kn) on the size of the union of all minimum spanning trees of G with some k vertices (or edges) removed. More generally, we show a bound of O(n logbn) on the size of a covering set in a matroid of rank n, which contains the minimum-weight basis of a random subset with high probability. Also, we give a randomized algorithm that calls an MST subroutine only a polylogarithmic number of times and finds the covering set with high probability. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006 Covering minimum spanning trees of random subgraphs Michel Goemans Jan Vondrák doi:10.1002/rsa.20115 Random Structures and Algorithms, Vol. 29, No. 3. (2006), pp. 257-276. 2006-09-04T19:00:47-00:00 2006 Random Structures and Algorithms 29 3 257 276 mst prob readme rndalg http://www.citeulike.org/user/mapio/article/1304934 <i>(16 May 2007)</i><br /><br />Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k∈{1,2,...,n-1}$, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of $G$ with $n-k+1$ vertices has at most $nk-\binomk+12$ elements. This proves a conjecture of Goemans and Vondrak \citeGV2005. We also show that the result is a generalization of Mader's Theorem, which bounds the number of edges in any edge-minimal $k$-connected graph. A tight bound on the collection of edges in MSTs of induced subgraphs Gregory Sorkin Angelika Steger Rico Zenklusen (16 May 2007) 2007-05-18T07:44:43-00:00 2007 mst prob readme rndalg http://www.citeulike.org/user/mapio/article/1082106 <i></i> The Curious History of Faà di Bruno’s Formula Warren Johnson 2007-02-01T14:36:18-00:00 comb reference http://www.citeulike.org/user/mapio/article/983553 <i>SIAM Review, Vol. 48, No. 3. (2006), pp. 569-581.</i><br /><br />Pages 569-581, The $25,000,000,000 Eigenvector: The Linear Algebra behind Google Kurt Bryan Tanya Leise SIAM Review, Vol. 48, No. 3. (2006), pp. 569-581. 2006-12-07T16:36:25-00:00 2006 SIAM Review 48 3 569 581 SIAM linalg pagerank http://www.citeulike.org/user/mapio/article/884640 <i>(2000)</i> Speech and Language Processing (2000) 2006-10-05T12:09:18-00:00 2000 ir ngram http://www.citeulike.org/user/mapio/article/853236 <i>(2001)</i><br /><br />Introduction Worst case analysis of an algorithm gives information on hard instances that may not be representative of its real behavior on the data of interest. In such situations, the analysis of its average behavior may give more useful information. Given a probability distribution on the set of inputs and a performance measure, we wish to analyze the expected value of this performance, seen as a random variable on the probability space defined by the inputs of a given size. Relevant... A guide to concentration bounds J Az J Petit M Serna (2001) 2006-09-21T16:01:54-00:00 2001 prob http://www.citeulike.org/user/mapio/article/850031 <i>(2005)</i> Multithreaded architectures and the sort benchmark Phil Garcia doi:10.1145/1114252.1114254 (2005) 2006-09-19T19:39:47-00:00 2005 ACM Press alg sorting http://www.citeulike.org/user/mapio/article/850013 <i>Inf. Process. Lett., Vol. 86, No. 5. (June 2003), pp. 229-233.</i> A new external sorting algorithm with no additional disk space Rafiqul Islam Nasim Adnan Nur Islam Shohorab Hossen doi:10.1016/S0020-0190(03)00201-1 Inf. Process. Lett., Vol. 86, No. 5. (June 2003), pp. 229-233. 2006-09-19T19:25:51-00:00 2003 Inf. Process. Lett. 0020-0190 86 5 229 233 Elsevier North-Holland, Inc. alg extmem largedataset sorting http://www.citeulike.org/user/mapio/article/845260 <i>ACM Transactions on Asian Language Information Processing (TALIP), Vol. 1, No. 3. (September 2002), pp. 269-278.</i> A language and character set determination method based on N-gram statistics Izumi Suzuki Yoshiki Mikami Ario Ohsato Yoshihide Chubachi doi:10.1145/772755.772759 ACM Transactions on Asian Language Information Processing (TALIP), Vol. 1, No. 3. (September 2002), pp. 269-278. 2006-09-15T12:56:31-00:00 2002 ACM Transactions on Asian Language Information Processing (TALIP) 1530-0226 1 3 269 278 ACM Press ir ngram http://www.citeulike.org/user/mapio/article/845233 <i>JADT (1995)</i> Comparing two Langage Identification Schemes Gregory Grefenstette JADT (1995) 2006-09-15T12:42:10-00:00 1995 JADT ir ngram http://www.citeulike.org/user/mapio/article/771528 <i></i> On An Online Spanning Tree Problem In Randomly Weighted Graphs Jan Remy Alexander Souza Angelika Steger 2006-07-24T15:05:53-00:00 mst online http://www.citeulike.org/user/mapio/article/768035 <i>(20 Jul 2006)</i><br /><br />The PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that the PageRank obeys a `power law' with the same exponent as the In-Degree. This paper presents a novel mathematical model that explains this phenomenon. The relation between the PageRank and In-Degree is modelled through a stochastic equation, which is inspired by the original definition of the PageRank, and is analogous to the well-known distributional identity for the busy period in the M/G/1 queue. Further, we employ the theory of regular variation and Tauberian theorems to analytically prove that the tail behavior of the PageRank and the In-Degree differ only by a multiplicative factor, for which we derive a closed-form expression. Our analytical results are in good agreement with experimental data. In-Degree and PageRank of Web pages: Why do they follow similar power laws? N Litvak WRW Scheinhardt Y Volkovich (20 Jul 2006) 2006-07-21T09:16:40-00:00 2006 pagerank powerlaw http://www.citeulike.org/user/mapio/article/303334 <i>Contemporary Physics, Vol. 46, No. 5. (September 2005), pp. 323-351.</i> Power laws, Pareto distributions and Zipf's law Mej Newman doi:10.1080/00107510500052444 Contemporary Physics, Vol. 46, No. 5. (September 2005), pp. 323-351. 2005-08-25T11:36:39-00:00 2005 Contemporary Physics 0010-7514 46 5 323 351 Taylor and Francis Ltd linkanalysis powerlaw http://www.citeulike.org/user/mapio/article/768228 <i>ACM Comput. Surv., Vol. 38, No. 1. (2006)</i> Graph mining: Laws, generators, and algorithms Deepayan Chakrabarti Christos Faloutsos doi:10.1145/1132952.1132954 ACM Comput. Surv., Vol. 38, No. 1. (2006) 2006-07-21T13:00:13-00:00 2006 ACM Comput. Surv. 0360-0300 38 1 ACM Press linkanalysis powerlaw webgraph http://www.citeulike.org/user/mapio/article/768347 <i>(21 Jun 2005)</i><br /><br />The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated. Counting polyominoes with minimum perimeter Sascha Kurz (21 Jun 2005) 2006-07-21T14:44:42-00:00 2005 comb polyominoes http://www.citeulike.org/user/mapio/article/766590 <i>Discrete Applied Mathematics, Vol. 140, No. 1-3. (15 May 2004), pp. 207-221.</i><br /><br />We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. Gray code for derangements J-L Baril Vincent Vajnovszki doi:10.1016/j.dam.2003.06.002 Discrete Applied Mathematics, Vol. 140, No. 1-3. (15 May 2004), pp. 207-221. 2006-07-20T13:25:11-00:00 2004 Discrete Applied Mathematics 140 1-3 207 221 alg comb http://www.citeulike.org/user/mapio/article/227604 <i>SIAM Rev., Vol. 47, No. 1. (2005), pp. 135-161.</i> A Survey of Eigenvector Methods for Web Information Retrieval Amy Langville Carl Meyer doi:10.1137/S0036144503424786 SIAM Rev., Vol. 47, No. 1. (2005), pp. 135-161. 2005-06-14T14:07:46-00:00 2005 SIAM Rev. 0036-1445 47 1 135 161 Society for Industrial and Applied Mathematics linalg linkanalysis pagerank http://www.citeulike.org/user/mapio/article/745247 <i>(6 Jul 2006)</i><br /><br />On the occasion of the 125-th anniversary of Newcomb's paper, a bibliography of academic work related to Benford's law from its year of origin 1881 to 2006 has been compiled. Benford's law from 1881 to 2006 Werner Hurlimann (6 Jul 2006) 2006-07-07T09:17:54-00:00 2006 prob stat webir http://www.citeulike.org/user/mapio/article/683956 <i></i> Mathematical developments from the analysis of card shuffling Persi Diaconis 2006-06-04T23:31:25-00:00 prob