2479 search results - page 229 / 496 » Random Event Structures |
180
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
215
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
ions in Process Mining: A Taxonomy of Patterns R.P. Jagadeesh Chandra Bose1,2 and Wil M.P. van der Aalst1 1 Department of Mathematics and Computer Science, University of Technology...
195
click to vote
GMP
2006
IEEE
16 years 20 days ago
2006
IEEE
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R2 to a...
173
click to vote
ASIAN
2004
Springer
16 years 14 hour ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
174
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...