1702 search results - page 181 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
139
Voted
PRL
2007
15 years 19 days ago
2007
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
DAC
2000
ACM
16 years 2 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
115
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
119
Voted
UAI
2008
15 years 2 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
109
Voted
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, we present a shape constrained Markov network for accurate face alignment. The global face shape is defined as a set of weighted shape samples which are integrated ...