Sciweavers

2944 search results - page 474 / 589
» Improving Bound Propagation
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 6 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
INFOCOM
2010
IEEE
15 years 4 months ago
Socially-Aware Network Design Games
—In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wh...
Jocelyne Elias, Fabio Martignon, Konstantin Avrach...
CVPR
2009
IEEE
17 years 1 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
ICCV
2009
IEEE
16 years 11 months ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...