Sciweavers

14649 search results - page 470 / 2930
» Principles of problem solving
Sort
View
ICIP
2007
IEEE
16 years 8 months ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...
CEC
2007
IEEE
16 years 1 months ago
Convergence and rate of convergence of a foraging ant model
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
Amine M. Boumaza, Bruno Scherrer
TACAS
2007
Springer
118views Algorithms» more  TACAS 2007»
16 years 1 months ago
Checking Pedigree Consistency with PCS
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
Panagiotis Manolios, Marc Galceran Oms, Sergi Oliv...
ICRA
2003
IEEE
231views Robotics» more  ICRA 2003»
16 years 5 days ago
Online simultaneous localization and mapping with detection and tracking of moving objects: theory and results from a ground veh
−−−− The simultaneous localization and mapping (SLAM) with detection and tracking of moving objects (DATMO) problem is not only to solve the SLAM problem in dynamic environ...
Chieh-Chih Wang, Charles E. Thorpe, Sebastian Thru...
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram