514 search results - page 43 / 103 » On enumerating all minimal solutions of feedback problems |
184
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
202
click to vote
CPAIOR
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
157
click to vote
JETC
2008
15 years 4 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
171
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...