805 search results - page 118 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
82
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
69
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measuremen...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
102
click to vote
SIAMCOMP
2012
12 years 12 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...