Sciweavers

3281 search results - page 121 / 657
» Bases for parametrized iterativity
Sort
View
129
Voted
ICML
2009
IEEE
16 years 2 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
ECCV
2002
Springer
16 years 3 months ago
Is Super-Resolution with Optical Flow Feasible?
Reconstruction-based super-resolution from motion video has been an active area of study in computer vision and video analysis. Image alignment is a key component of super-resoluti...
Wen-Yi Zhao, Harpreet S. Sawhney
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
15 years 8 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...
ICDAR
2003
IEEE
15 years 7 months ago
On Machine Understanding of Online Handwritten Mathematical Expressions
This paper aims at automatic recognition of online handwritten mathematical expressions written on an electronic tablet. The proposed technique involves two major stages: symbol r...
Utpal Garain, B. B. Chaudhuri
FOSSACS
2004
Springer
15 years 5 months ago
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
Pablo Giambiagi, Gerardo Schneider, Frank D. Valen...