Sciweavers

231 search results - page 41 / 47
» Sublinear time approximate clustering
Sort
View
JFR
2006
88views more  JFR 2006»
13 years 7 months ago
Discovering natural kinds of robot sensory experiences in unstructured environments
We derive categories directly from robot sensor data to address the symbol grounding problem. Unlike model-based approaches where human intuitive correspondences are sought betwee...
Daniel H. Grollman, Odest Chadwicke Jenkins, Frank...
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 9 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei
IPPS
2006
IEEE
14 years 1 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
INFOCOM
2005
IEEE
14 years 1 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 11 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic