4541 search results - page 37 / 909 » Cache-Oblivious Algorithms and Data Structures |
ESA
2006
Springer
15 years 2 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
IIE
2007
14 years 11 months ago
2007
Abstract. A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the ta...
IJAR
2010
14 years 9 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
AAAI
2007
15 years 1 months ago
2007
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
SODA
2004
ACM
15 years 12 days ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...