425 search results - page 65 / 85 » Polynomial Time Data Reduction for Dominating Set |
182
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
155
click to vote
JAIR
2008
15 years 5 months ago
2008
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
181
click to vote
CLOUD
2010
ACM
15 years 11 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
181
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
170
click to vote
RECOMB
2009
Springer
16 years 6 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...