Sciweavers

482 search results - page 84 / 97
» A Linear-Time Graph Kernel
Sort
View
CIE
2007
Springer
16 years 17 days ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
ICPR
2006
IEEE
16 years 7 months ago
A Semi-supervised SVM for Manifold Learning
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...
Zhili Wu, Chun-hung Li, Ji Zhu, Jian Huang
ICCAD
1994
IEEE
111views Hardware» more  ICCAD 1994»
15 years 10 months ago
On modeling top-down VLSI design
We present an improved data model that reflects the whole VLSI design process including bottom-up and topdown design phases. The kernel of the model is a static version concept th...
Bernd Schürmann, Joachim Altmeyer, Martin Sch...
CASES
2007
ACM
15 years 10 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra
ICS
1995
Tsinghua U.
15 years 10 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...