Sciweavers

279 search results - page 49 / 56
» Degree-bounded minimum spanning trees
Sort
View
TRECVID
2007
13 years 8 months ago
Eurecom at TRECVid 2007: Extraction of High-level Features
In this paper we describe our experiments for the high level features extraction task of TRECVid 2007. Our approach is different than previous submissions in that we have impleme...
Rachid Benmokhtar, Eric Galmar, Benoit Huet
ETRA
2010
ACM
213views Biometrics» more  ETRA 2010»
13 years 8 months ago
Qualitative and quantitative scoring and evaluation of the eye movement classification algorithms
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
Oleg V. Komogortsev, Sampath Jayarathna, Do Hyong ...

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
CVPR
2006
IEEE
14 years 9 months ago
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
Jingyu Yan, Marc Pollefeys
DATE
2007
IEEE
81views Hardware» more  DATE 2007»
14 years 1 months ago
Using the inter- and intra-switch regularity in NoC switch testing
This paper proposes an efficient test methodology to test switches in a Network-on-Chip (NoC) architecture. A switch in an NoC consists of a number of ports and a router. Using th...
Mohammad Hosseinabady, Atefe Dalirsani, Zainalabed...