2498 search results - page 178 / 500 » Data Structures with Unpredictable Timing |
162
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
94
Voted
JAR
2006
14 years 10 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
85
Voted
JACM
2000
14 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
78
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We discuss the Innovation Jam that IBM carried out in 2006, with the objective of identifying innovative and promising "Big Ideas" through a moderated on-line discussion...
76
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...