Sciweavers

3020 search results - page 583 / 604
» Optimal partition trees
Sort
View
140
Voted
ICS
2010
Tsinghua U.
16 years 1 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
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
16 years 26 days 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
113
Voted
RECOMB
2010
Springer
15 years 11 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 10 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
156
Voted
MOBICOM
2009
ACM
15 years 10 months ago
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
Shuo Guo, Yu Gu, Bo Jiang, Tian He