274 search results - page 28 / 55 » On Random Sampling over Joins |
126
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
The increased use of context for high level reasoning has been popular in recent works to increase recognition accuracy. In this paper, we consider an orthogonal application of con...
116
Voted
CAV
2009
Springer
16 years 2 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
104
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— We investigate the problem of inferring the packet loss characteristics of Internet links using server-based measurements. Unlike much of existing work on network tomography th...
111
click to vote
BMVC
2000
15 years 3 months ago
2000
Automatic Target Recognition (ATR) is a demanding application that requires separation of targets from a noisy background in a sequence of images. In our previous work [5] the bac...
107
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
15 years 10 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...