Sciweavers

3333 search results - page 508 / 667
» Abstract Proof Search
Sort
View
DIS
2010
Springer
15 years 4 months ago
Speeding Up and Boosting Diverse Density Learning
Abstract. In multi-instance learning, each example is described by a bag of instances instead of a single feature vector. In this paper, we revisit the idea of performing multi-ins...
James R. Foulds, Eibe Frank
PVLDB
2008
216views more  PVLDB 2008»
15 years 4 months ago
Ad-hoc data processing in the cloud
Ad-hoc data processing has proven to be a critical paradigm for Internet companies processing large volumes of unstructured data. However, the emergence of cloud-based computing, ...
Dionysios Logothetis, Ken Yocum
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 4 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
SWARM
2010
SPRINGER
420views Optimization» more  SWARM 2010»
15 years 4 months ago
Fireworks Algorithm for Optimization
Abstract. Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex function...
Ying Tan, Yuanchun Zhu
DATESO
2010
150views Database» more  DATESO 2010»
15 years 3 months ago
Evolving Quasigroups by Genetic Algorithms
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Václav Snásel, Jiri Dvorský, ...