8301 search results - page 1427 / 1661 » Risk-Aware Information Retrieval |
171
click to vote
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...
178
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...
154
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. ...
167
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 ...
168
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...