Sciweavers

15073 search results - page 270 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
RECOMB
2000
Springer
15 years 8 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
16 years 4 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
CVPR
2008
IEEE
16 years 6 months ago
Learning for stereo vision using the structured support vector machine
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
Yunpeng Li, Daniel P. Huttenlocher
IPSN
2005
Springer
15 years 10 months ago
A robust architecture for distributed inference in sensor networks
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
Mark A. Paskin, Carlos Guestrin, Jim McFadden
EDBT
2008
ACM
99views Database» more  EDBT 2008»
16 years 4 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan