Sciweavers

160 search results - page 19 / 32
» Approximate Computation of Object Distances by Locality-Sens...
Sort
View
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
14 years 7 days ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
TKDE
2008
162views more  TKDE 2008»
13 years 7 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
COLCOM
2005
IEEE
14 years 1 months ago
On-demand overlay networking of collaborative applications
We propose a new overlay network, called Generic Identifier Network (GIN), for collaborative nodes to share objects with transactions across affiliated organizations by merging th...
Cheng-Jia Lai, Richard R. Muntz
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
14 years 9 months ago
Substructure Clustering on Sequential 3d Object Datasets
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
Zhenqiang Tan, Anthony K. H. Tung
NIPS
2004
13 years 9 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp