409 search results - page 49 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
SCALESPACE
2005
Springer
15 years 3 months ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
92
Voted
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
ALGORITHMICA
2004
14 years 9 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...