Sciweavers

602 search results - page 113 / 121
» A New Approximation Method of the Quadratic Discriminant Fun...
Sort
View
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
16 years 14 days ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
16 years 8 days ago
Efficient testbench code synthesis for a hardware emulator system
: - The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to...
Ioannis Mavroidis, Ioannis Papaefstathiou
166
Voted
SMA
2005
ACM
201views Solid Modeling» more  SMA 2005»
15 years 11 months ago
Fast and robust detection of crest lines on meshes
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...
COMPGEOM
2003
ACM
15 years 11 months ago
Billboard clouds
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...
Xavier Décoret, Frédo Durand, Fran&c...
IJON
2006
131views more  IJON 2006»
15 years 5 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...