5350 search results - page 278 / 1070 » Space and time in eco-ontologies |
172
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
190
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
274
click to vote
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
194
click to vote
NCA
2007
IEEE
16 years 1 months ago
2007
IEEE
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...