6740 search results - page 994 / 1348 » An s -Hamiltonian Line Graph Problem |
207
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
162
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
304
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
175
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
167
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...