Sciweavers

3946 search results - page 762 / 790
» The computational complexity of choice sets
Sort
View
159
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 4 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...
EDBT
2002
ACM
125views Database» more  EDBT 2002»
16 years 4 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
EDBT
2008
ACM
169views Database» more  EDBT 2008»
16 years 4 months ago
BioScout: a life-science query monitoring system
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
137
Voted
WISE
2009
Springer
16 years 1 months ago
Spectral Clustering in Social-Tagging Systems
Social tagging is an increasingly popular phenomenon with substantial impact on the way we perceive and understand the Web. For the many Web resources that are not self-descriptive...
Alexandros Nanopoulos, Hans-Henning Gabriel, Myra ...
EUROSYS
2010
ACM
16 years 1 months ago
A Comprehensive Scheduler for Asymmetric Multicore Systems
Symmetric-ISA (instruction set architecture) asymmetricperformance multicore processors were shown to deliver higher performance per watt and area for codes with diverse architect...
Juan Carlos Saez, Manuel Prieto Matias, Alexandra ...