8313 search results - page 1333 / 1663 » Serendipitous Information Retrieval |
185
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
175
Voted
FOIKS
2010
Springer
16 years 1 months ago
2010
Springer
The current web is a web of linked pages. Frustrated users search for facts by guessing which keywords or keyword phrases might lead them to pages where they can find facts. Can w...
179
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
159
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
172
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...