Sciweavers

1283 search results - page 151 / 257
» Probabilistic structured query methods
Sort
View
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 1 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
SIGMOD
2003
ACM
96views Database» more  SIGMOD 2003»
14 years 9 months ago
Toward network data independence
A number of researchers have become interested in the design of global-scale networked systems and applications. Our thesis here is that the database community's principles a...
Joseph M. Hellerstein
CIKM
2010
Springer
13 years 7 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel
WWW
2008
ACM
14 years 9 months ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...