Sciweavers

14548 search results - page 2461 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICS
2010
Tsinghua U.
16 years 4 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
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
16 years 3 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
209
Voted
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
16 years 3 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
WWW
2010
ACM
16 years 1 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
220
Voted
WWW
2010
ACM
16 years 1 months ago
Selecting skyline services for QoS-based web service composition
Web service composition enables seamless and dynamic integration of business applications on the web. The performance of the composed application is determined by the performance ...
Mohammad Alrifai, Dimitrios Skoutas, Thomas Risse
« Prev « First page 2461 / 2910 Last » Next »