Sciweavers

1254 search results - page 189 / 251
» Making Hard Problems Harder
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 9 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 9 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
14 years 9 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 9 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 9 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman