Sciweavers

4860 search results - page 477 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
15 years 7 months ago
Efficient memoryless protocol for tag identification
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Ching Law, Kayi Lee, Kai-Yeung Siu
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
AMW
2010
15 years 5 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
IJCAI
2001
15 years 5 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
101
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Frame domain signal processing: Framework and applications
Besides basis expansions, frames representations play a key role in signal processing. We thus consider the problem of frame domain signal processing, which is more complex and ch...
Amina Chebira, Matthew Fickus, Martin Vetterli