Sciweavers

237 search results - page 16 / 48
» Just enough tabling
Sort
View
FUN
2010
Springer
279views Algorithms» more  FUN 2010»
13 years 5 months ago
Cracking Bank PINs by Playing Mastermind
The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct ...
Riccardo Focardi, Flaminia L. Luccio
IPPS
2003
IEEE
14 years 25 days ago
A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotide-Long DNA Sequences. Applications to Human Genomics
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
Vicente Arnau, Ignacio Marín
DEBS
2003
ACM
14 years 24 days ago
Relational subscription middleware for Internet-scale publish-subscribe
We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with “relational subscriptions”, to support timely updates...
Yuhui Jin, Robert E. Strom
NAACL
2004
13 years 9 months ago
Lattice-Based Search for Spoken Utterance Retrieval
Recent work on spoken document retrieval has suggested that it is adequate to take the singlebest output of ASR, and perform text retrieval on this output. This is reasonable enou...
Murat Saraclar, Richard Sproat
ICML
1996
IEEE
14 years 8 months ago
Discretizing Continuous Attributes While Learning Bayesian Networks
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...
Moisés Goldszmidt, Nir Friedman