Sciweavers

142 search results - page 25 / 29
» Clustering Large Datasets in Arbitrary Metric Spaces
Sort
View
SPAA
2005
ACM
14 years 28 days ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
OSDI
2008
ACM
13 years 9 months ago
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Bud...
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
13 years 8 months ago
Making Time-Series Classification More Accurate Using Learned Constraints
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
SSD
2005
Springer
108views Database» more  SSD 2005»
14 years 26 days ago
On Trip Planning Queries in Spatial Databases
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
Feifei Li, Dihan Cheng, Marios Hadjieleftheriou, G...