Sciweavers

56 search results - page 6 / 12
» A Feasible Nonconvex Relaxation Approach to Feature Selectio...
Sort
View
ICCV
2007
IEEE
16 years 1 months ago
Vector Quantizing Feature Space with a Regular Lattice
Most recent class-level object recognition systems work with visual words, i.e., vector quantized local descriptors. In this paper we examine the feasibility of a dataindependent ...
Tinne Tuytelaars, Cordelia Schmid
IJDAR
2010
169views more  IJDAR 2010»
14 years 9 months ago
A Bayesian network for combining descriptors: application to symbol recognition
Inthispaper,weproposeadescriptorcombination method, which enables to improve significantly the recognition rate compared to the recognition rates obtained by each descriptor. This ...
Sabine Barrat, Salvatore Tabbone
EAAI
2007
154views more  EAAI 2007»
14 years 11 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
UM
2010
Springer
14 years 9 months ago
Inducing Effective Pedagogical Strategies Using Learning Context Features
Effective pedagogical strategies are important for e-learning environments. While it is assumed that an effective learning environment should craft and adapt its actions to the use...
Min Chi, Kurt VanLehn, Diane J. Litman, Pamela W. ...
MODELS
2009
Springer
15 years 5 months ago
Dead or Alive: finding zombie features in the Linux kernel
Variability management in operating systems is an errorprone and tedious task. This is especially true for the Linux operating system, which provides a specialized tool called Kco...
Reinhard Tartler, Julio Sincero, Wolfgang Schr&oum...