Sciweavers

4432 search results - page 679 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
VC
2008
143views more  VC 2008»
15 years 18 days ago
Example-driven animation synthesis
We introduce an easy and intuitive approach to create animations by assembling existing animations. Using our system, the user needs only to simply scribble regions of interest and...
Yu-Shuen Wang, Tong-Yee Lee
85
Voted
PRL
2007
158views more  PRL 2007»
15 years 6 days ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan
109
Voted
MCS
2010
Springer
14 years 11 months ago
A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, Da...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
14 years 10 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
154
Voted
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
14 years 10 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...