Sciweavers

641 search results - page 100 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
CSDA
2007
106views more  CSDA 2007»
14 years 9 months ago
Parsimonious additive models
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...
Marta Avalos, Yves Grandvalet, Christophe Ambroise
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 4 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
MICRO
2003
IEEE
132views Hardware» more  MICRO 2003»
15 years 2 months ago
Checkpoint Processing and Recovery: Towards Scalable Large Instruction Window Processors
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
Haitham Akkary, Ravi Rajwar, Srikanth T. Srinivasa...
62
Voted
TCOM
2008
81views more  TCOM 2008»
14 years 9 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
DAC
2012
ACM
13 years 2 days ago
WCET-centric partial instruction cache locking
Caches play an important role in embedded systems by bridging the performance gap between high speed processors and slow memory. At the same time, caches introduce imprecision in ...
Huping Ding, Yun Liang, Tulika Mitra