Sciweavers

1927 search results - page 342 / 386
» UMDAs for dynamic optimization problems
Sort
View
ECCV
2010
Springer
15 years 22 days ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 20 days ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
131
Voted
NIPS
2004
15 years 1 months ago
Probabilistic Computation in Spiking Populations
As animals interact with their environments, they must constantly update estimates about their states. Bayesian models combine prior probabilities, a dynamical model and sensory e...
Richard S. Zemel, Quentin J. M. Huys, Rama Nataraj...
ICIW
2009
IEEE
15 years 7 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
94
Voted
BMCBI
2008
105views more  BMCBI 2008»
15 years 20 days ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...