2254 search results - page 315 / 451 » Computing the minimal covering set |
157
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Ad hoc networks formed by traveling vehicles are envisaged to become a common platform that will support a wide variety of applications, ranging from road safety to advertising an...
190
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and ...
132
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
154
Voted
EVOW
2009
Springer
16 years 28 days ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
109
click to vote
EMMCVPR
2009
Springer
16 years 21 days ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Bayesian boundary models often assume tha...