4850 search results - page 730 / 970 » Approximate Data Structures with Applications |
133
Voted
CAD
2005
Springer
15 years 4 months ago
2005
Springer
Heterogeneous structures represent an important new frontier for 21st century engineering. Human tissues, composites, `smart' and multimaterial objects are all physically man...
180
click to vote
TPDS
2010
15 years 3 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
159
click to vote
PPOPP
2012
ACM
14 years 15 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
144
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
147
Voted
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...