Sciweavers

1331 search results - page 211 / 267
» Complexity bounds for zero-test algorithms
Sort
View
DCC
2002
IEEE
15 years 9 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
PODC
2004
ACM
15 years 3 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
15 years 11 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
ICML
2004
IEEE
15 years 10 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...