Sciweavers

122 search results - page 8 / 25
» A Short Cut to Optimal Sequences
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 7 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
TSP
2008
135views more  TSP 2008»
14 years 9 months ago
Nonlinear Channel Equalization With Gaussian Processes for Regression
We propose Gaussian processes for regression as a novel nonlinear equalizer for digital communications receivers. GPR's main advantage, compared to previous nonlinear estimat...
Fernando Pérez-Cruz, Juan José Muril...
FSTTCS
2003
Springer
15 years 2 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
RECOMB
2009
Springer
15 years 4 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
CVPR
2004
IEEE
15 years 11 months ago
Accurate Face Models from Uncalibrated and Ill-Lit Video Sequences
In this paper, we propose a face reconstruction technique that produces models that not only look good when texture mapped, but are also metrically accurate. Our method is designe...
Miodrag Dimitrijevic, Slobodan Ilic, Pascal Fua