Sciweavers

501 search results - page 29 / 101
» Rough Sets and Approximation Schemes
Sort
View
IJCV
2006
164views more  IJCV 2006»
13 years 10 months ago
Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours
Based on recent work on Stochastic Partial Differential Equations (SPDEs), this paper presents a simple and well-founded method to implement the stochastic evolution of a curve. F...
Olivier Juan, Renaud Keriven, Gheorghe Postelnicu
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
CODES
1998
IEEE
14 years 2 months ago
Software timing analysis using HW/SW cosimulation and instruction set simulator
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
Jie Liu, Marcello Lajolo, Alberto L. Sangiovanni-V...
FGR
2006
IEEE
169views Biometrics» more  FGR 2006»
14 years 3 months ago
Combining PCA and LFA for Surface Reconstruction from a Sparse Set of Control Points
This paper presents a novel method for 3D surface reconstruction based on a sparse set of 3D control points. For object classes such as human heads, prior information about the cl...
Reinhard Knothe, Sami Romdhani, Thomas Vetter
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Epsilon-constraint with an efficient cultured differential evolution
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
Ricardo Landa Becerra, Carlos A. Coello Coello