Sciweavers

1611 search results - page 269 / 323
» Queries Independent of Updates
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 1 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
NAR
2008
175views more  NAR 2008»
14 years 11 months ago
Onto-CC: a web server for identifying Gene Ontology conceptual clusters
The Gene Ontology (GO) vocabulary has been extensively explored to analyze the functions of coexpressed genes. However, despite its extended use in Biology and Medical Sciences, t...
Rocío Romero-Záliz, Coral del Val, J...
ICDS
2007
IEEE
15 years 6 months ago
On Smart-Care Services: Studies of Visually Impaired Users in Living Contexts
- Smart care technology is any sensor based technology used to aid and support human independent living. Such technologies offer new potential and can give rise to new problems for...
Ying Liu, Jean Bacon, Roger Wilson-Hinds
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 7 hour ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
73
Voted
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 11 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...