Sciweavers

5153 search results - page 584 / 1031
» Introduction to Randomized Algorithms
Sort
View
ICASSP
2008
IEEE
16 years 26 days ago
Average case analysis of sparse recovery with thresholding : New bounds based on average dictionary coherence
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabi...
Mohammad Golbabaee, Pierre Vandergheynst
ICPR
2008
IEEE
16 years 25 days ago
Image annotation refinement using semantic similarity correlation
Automatic image annotation is a promising way to achieve more effective image management and retrieval by using keywords. However, system performances of the existing state-of-the...
Songhao Zhu, Yuncai Liu
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
16 years 24 days ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
ASIAMS
2007
IEEE
16 years 23 days ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
CEC
2007
IEEE
16 years 23 days ago
Towards an immune system that solves CSP
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
María-Cristina Riff, Marcos Zú&ntild...