Sciweavers

2635 search results - page 94 / 527
» Algorithms for the Database Layout Problem
Sort
View
DASFAA
2011
IEEE
206views Database» more  DASFAA 2011»
14 years 7 months ago
A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML
Abstract. Uncertainty is inherently ubiquitous in data of real applications, and those uncertain data can be naturally represented by the XML. Matching twig pattern against XML dat...
Bo Ning, Chengfei Liu
ICML
2003
IEEE
16 years 4 months ago
Stochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
Stefan Kramer, Ulrich Rückert
131
Voted
GIS
2008
ACM
15 years 5 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
PVLDB
2010
159views more  PVLDB 2010»
15 years 2 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...
DKE
2002
113views more  DKE 2002»
15 years 3 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...