2109 search results - page 44 / 422 » Solving Necklace Constraint Problems |
133
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
140
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
151
click to vote
DATESO
2007
15 years 5 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
132
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
116
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...