644 search results - page 78 / 129 » Decomposition Complexity |
250
Voted
ICDAR
2011
IEEE
14 years 5 days ago
2011
IEEE
This paper presents a fully automatic framework for the restoration of double-sided historical manuscripts which are impaired by ink bleed-through distortions. First, the recto si...
126
Voted
SAC
2004
ACM
15 years 6 months ago
2004
ACM
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
102
Voted
AI
1998
Springer
15 years 4 months ago
1998
Springer
Noun phrases carry much of the information in a text. Systems that attempt to acquire knowledge from text must first decompose complex noun phrases to get access to that informatio...
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
124
click to vote
CONSTRAINTS
2006
15 years 18 days ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...