Sciweavers

401 search results - page 36 / 81
» Sparse Quasi-Random Graphs
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
FGR
2008
IEEE
254views Biometrics» more  FGR 2008»
13 years 9 months ago
Design sparse features for age estimation using hierarchical face model
A key point in automatic age estimation is to design feature set essential to age perception. To achieve this goal, this paper builds up a hierarchical graphical face model for fa...
Jin-Li Suo, Tianfu Wu, Song Chun Zhu, Shiguang Sha...
ICPP
1993
IEEE
13 years 12 months ago
A Concurrent Dynamic Task Graph
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
Theodore Johnson
ICTAI
2006
IEEE
14 years 1 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
MICCAI
2010
Springer
13 years 6 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...