13603 search results - page 101 / 2721 » On the Computational Complexity of Cut-Reduction |
162
click to vote
BMVC
2002
15 years 8 months ago
2002
The fusion of images is the process of combining two or more images into a single image retaining important features from each. Fusion is an important technique within many dispar...
186
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
159
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
161
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
135
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...