Sciweavers

1160 search results - page 195 / 232
» Applying Constraint Solving to the Management of Distributed...
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 2 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 12 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 6 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
KCAP
2005
ACM
15 years 5 months ago
Estimating similarity among collaboration contributions
The need for collaboration arises in many activities required for effective problem solving and decision making. We are developing Angler, a web-services tool that supports collab...
Kenneth S. Murray, John D. Lowrance, Douglas E. Ap...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 4 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu