Sciweavers

103 search results - page 4 / 21
» An Efficient Sparse Regularity Concept
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...
Marc Boule, Zeljko Zilic
ISBI
2007
IEEE
14 years 1 months ago
Space-Time Sparsity Regularization for the Magnetoencephalography Inverse Problem
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...
GLOBECOM
2009
IEEE
13 years 5 months ago
On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
Diego Lucerna, Nicola Gatti, Guido Maier, Achille ...
CVPR
2007
IEEE
14 years 9 months ago
A Multi-Scale Tikhonov Regularization Scheme for Implicit Surface Modelling
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape mo...
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu