4377 search results - page 299 / 876 » Mass problems and randomness |
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
195
click to vote
PKDD
2005
Springer
16 years 6 days ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
207
click to vote
JUCS
2006
15 years 6 months ago
2006
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
186
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
175
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...