Sciweavers

225 search results - page 12 / 45
» From polynomial time queries to graph structure theory
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
15 years 10 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
15 years 7 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
86
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 3 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
AAAI
2006
14 years 11 months ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...