Sciweavers

770 search results - page 78 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
CASES
2003
ACM
15 years 3 months ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
15 years 2 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
ECCV
2002
Springer
15 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
BMVC
2010
14 years 7 months ago
Multi-class Boosting for Early Classification of Sequences
We propose a new boosting algorithm for sequence classification, in particular one that enables early classification of multiple classes. In many practical problems, we would like...
Katsuhiko Ishiguro, Hiroshi Sawada, Hitoshi Sakano
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
15 years 3 months ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl