Sciweavers

417 search results - page 30 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
PROMISE
2010
14 years 4 months ago
On the value of learning from defect dense components for software defect prediction
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
Hongyu Zhang, Adam Nelson, Tim Menzies
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 4 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
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
IUI
2009
ACM
15 years 6 months ago
Detecting and correcting user activity switches: algorithms and interfaces
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
Jianqiang Shen, Jed Irvine, Xinlong Bao, Michael G...
SIAMDM
2000
159views more  SIAMDM 2000»
14 years 9 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer