2168 search results - page 357 / 434 » Randomized Algorithms and Complexity Theory |
206
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
317
click to vote
PODS
2011
ACM
14 years 10 months ago
2011
ACM
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
237
click to vote
JACM
2010
15 years 5 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
203
click to vote
ACISICIS
2008
IEEE
15 years 9 months ago
2008
IEEE
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
206
click to vote
SIAMDM
2008
15 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...