1772 search results - page 104 / 355 » Classifying Problems into Complexity Classes |
135
Voted
SODA
2000
ACM
15 years 4 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
137
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
110
click to vote
EOR
2008
15 years 2 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
125
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
In object recognition problems a two-stage system is usually adopted composed of a fast and simple detector and a more complex classifier. This paper studies a design of the secon...