Sciweavers

4860 search results - page 313 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
92
Voted
TALG
2010
86views more  TALG 2010»
14 years 11 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
117
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
CEC
2005
IEEE
15 years 6 months ago
Hybrid evolutionary static scheduling for heterogeneous systems
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
Cristina Boeres, Eyder Rios, Luiz Satoru Ochi
NIPS
2001
15 years 2 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
106
Voted
ICNP
2005
IEEE
15 years 6 months ago
A Family of Collusion Resistant Protocols for Instantiating Security
In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and t...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar