Sciweavers

903 search results - page 71 / 181
» Non-well-founded trees in categories
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 10 days ago
Genetic programming for cross-task knowledge sharing
We consider multitask learning of visual concepts within genetic programming (GP) framework. The proposed method evolves a population of GP individuals, with each of them composed...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
16 years 4 days ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
SIGIR
2003
ACM
15 years 11 months ago
Question classification using support vector machines
Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. W...
Dell Zhang, Wee Sun Lee
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
CVPR
2010
IEEE
16 years 2 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...