Sciweavers

1126 search results - page 176 / 226
» Strong Feature Sets from Small Samples
Sort
View
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 10 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
LWA
2007
13 years 10 months ago
Towards Learning User-Adaptive State Models in a Conversational Recommender System
Typical conversational recommender systems support interactive strategies that are hard-coded in advance and followed rigidly during a recommendation session. In fact, Reinforceme...
Tariq Mahmood, Francesco Ricci
PAMI
2010
181views more  PAMI 2010»
13 years 7 months ago
Using Language to Learn Structured Appearance Models for Image Annotation
Abstract— Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to simultaneously learn the names and appearances o...
Michael Jamieson, Afsaneh Fazly, Suzanne Stevenson...
CVPR
2005
IEEE
14 years 11 months ago
Pedestrian Detection in Crowded Scenes
In this paper, we address the problem of detecting pedestrians in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any t...
Bastian Leibe, Edgar Seemann, Bernt Schiele
ICCBR
2003
Springer
14 years 2 months ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...