8825 search results - page 1390 / 1765 » All for one or one for all |
111
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
148
click to vote
CISS
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
147
click to vote
SIGUCCS
2006
ACM
15 years 7 months ago
2006
ACM
In this paper we present the results of an experiment made with our e-librarian service ”MatES”, an e-Learning tool on fractions in mathematics. MatES allows students to enter...
138
click to vote
DM
2000
15 years 1 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
124
click to vote
WWW
2003
ACM
16 years 2 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...