4432 search results - page 507 / 887 » Solving Demodulation as an Optimization Problem |
121
click to vote
DCOSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
135
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
139
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
147
click to vote
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
A fundamental problem in computer vision (CV) is the estimation of geometric parameters from multiple observations obtained from images; examples of such problems range from ellip...
136
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...