Sciweavers

705 search results - page 89 / 141
» Proximity Cluster Trees
Sort
View
105
Voted
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 4 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
LKR
2008
15 years 2 months ago
Order Retrieval
Abstract. Extensive work has been done in recent years on automatically grouping words into categories. For example, {Wednesday, Monday, Tuesday} could be grouped into a `days of w...
Neil Rubens, Vera Sheinman, Takenobu Tokunaga, Mas...
APVIS
2006
15 years 1 months ago
How people read sociograms: a questionnaire study
Visualizing social network data into sociograms plays an important role in communicating information about network characteristics. Previous studies have shown that human percepti...
Weidong Huang, Seok-Hee Hong, Peter Eades
139
Voted
IVC
2008
223views more  IVC 2008»
15 years 16 days ago
Euclidean path modeling for video surveillance
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
Imran N. Junejo, Hassan Foroosh
172
Voted
JPDC
2007
138views more  JPDC 2007»
15 years 13 days ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki