Sciweavers

226 search results - page 28 / 46
» A power penalty method for linear complementarity problems
Sort
View
93
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
PAMI
2006
132views more  PAMI 2006»
14 years 9 months ago
Capitalize on Dimensionality Increasing Techniques for Improving Face Recognition Grand Challenge Performance
This paper presents a novel pattern recognition framework by capitalizing on dimensionality increasing techniques. In particular, the framework integrates Gabor image representatio...
Chengjun Liu
BMCBI
2005
100views more  BMCBI 2005»
14 years 9 months ago
Evolutionary models for insertions and deletions in a probabilistic modeling framework
Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
Elena Rivas
80
Voted
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
14 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
TASE
2008
IEEE
14 years 9 months ago
On Clamping Planning in Workpiece-Fixture Systems
Deformation at contacts between the workpiece and locators/clamps resulting from large contact forces causes overall workpiece displacement, and affects the localization accuracy o...
Caihua Xiong, Michael Yu Wang, You-Lun Xiong