Sciweavers

277 search results - page 48 / 56
» The saga of minimum spanning trees
Sort
View
TRECVID
2007
14 years 5 hour 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

Lecture Notes
443views
15 years 8 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
15 years 26 days 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 5 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...
ICPP
2005
IEEE
14 years 4 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao