2498 search results - page 208 / 500 » Data Structures with Unpredictable Timing |
145
click to vote
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
238
Voted
STOC
2012
ACM
13 years 4 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
ISBI
2002
IEEE
16 years 3 months ago
2002
IEEE
Confocal microscopes have recently allowed biologists and biomedical researchers to obtain time dependent 3D data sets of biological objects, such as cells and tissues. Scientific...
128
click to vote
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
119
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...