Sciweavers

134 search results - page 27 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
ICS
2010
Tsinghua U.
14 years 2 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ESWA
2007
176views more  ESWA 2007»
13 years 4 months ago
Credit scoring with a data mining approach based on support vector machines
The credit card industry has been growing rapidly recently, and thus huge numbers of consumers’ credit data are collected by the credit department of the bank. The credit scorin...
Cheng-Lung Huang, Mu-Chen Chen, Chieh-Jen Wang
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
13 years 11 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 4 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry