Sciweavers

1380 search results - page 218 / 276
» A General Polynomial Sieve
Sort
View
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
13 years 9 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
CN
2008
126views more  CN 2008»
13 years 8 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 8 months ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven