8917 search results - page 1358 / 1784 » Abstraction in Algorithm Animation |
283
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
163
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as m...
176
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
129
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
156
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...