Sciweavers

1998 search results - page 314 / 400
» Complexity of the Cover Polynomial
Sort
View
108
Voted
RECOMB
2008
Springer
16 years 29 days ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
RECOMB
2006
Springer
16 years 29 days ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 29 days ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
104
Voted
ICALP
2009
Springer
16 years 28 days ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
185
Voted
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 26 days ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu