Sciweavers

921 search results - page 85 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
SAC
2005
ACM
15 years 9 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
CVPR
2010
IEEE
15 years 7 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
GEOINFORMATICA
2007
223views more  GEOINFORMATICA 2007»
15 years 4 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya...
SIGMOD
2005
ACM
117views Database» more  SIGMOD 2005»
16 years 4 months ago
Relational data mapping in MIQIS
We demonstrate a prototype of the relational data mapping module of MIQIS, a formal framework for investigating information flow in peer-to-peer database management systems. Data ...
George H. L. Fletcher, Catharine M. Wyss
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 5 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...