808 search results - page 137 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
94
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
KDD
2008
ACM
16 years 1 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
95
Voted
WADS
1997
Springer
15 years 4 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
107
click to vote
AAAI
2010
15 years 2 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
115
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...