4112 search results - page 117 / 823 » Efficient Algorithms for the Spoonerism Problem |
124
click to vote
CAD
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
137
click to vote
AAAI
2010
15 years 5 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
132
Voted
ICDAR
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
147
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
142
click to vote
NIPS
2008
15 years 5 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...