Sciweavers

942 search results - page 168 / 189
» Distance Constraint Satisfaction Problems
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 9 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
DAGSTUHL
2007
13 years 11 months ago
Nonlinear Approximation and Image Representation using Wavelets
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
Sudipto Guha, Boulos Harb
FOCS
2007
IEEE
14 years 4 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
WG
2005
Springer
14 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 3 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...