Sciweavers

539 search results - page 41 / 108
» Recurrence relations and fast algorithms
Sort
View
NIPS
2007
15 years 1 months ago
Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition
We present a new and efficient semi-supervised training method for parameter estimation and feature selection in conditional random fields (CRFs). In real-world applications suc...
Maryam Mahdaviani, Tanzeem Choudhury
CMS
2010
207views Communications» more  CMS 2010»
15 years 20 days ago
Statistical Detection of Malicious PE-Executables for Fast Offline Analysis
While conventional malware detection approaches increasingly fail, modern heuristic strategies often perform dynamically, which is not possible in many applications due to related ...
Ronny Merkel, Tobias Hoppe, Christian Krätzer...
108
Voted
JMM2
2006
121views more  JMM2 2006»
15 years 12 days ago
Fast Image Mosaicing for Panoramic Face Recognition
In this article, we present some development results of a system that performs mosaicing (or mosaicking) of panoramic faces. Our objective is to study the feasibility of panoramic ...
Fan Yang, Michel Paindavoine, Hervé Abdi, D...
NIPS
2007
15 years 1 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
89
Voted
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 4 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...