47 search results - page 6 / 10 » Exact and Approximation Algorithms for DNA Tag Set Design |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
MLDM
2008
Springer
13 years 7 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...