8311 search results - page 1329 / 1663 » Phase-Based Information Retrieval |
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 ...
170
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 ...
225
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...