Sciweavers

334 search results - page 59 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
ASIAMS
2007
IEEE
14 years 2 months ago
Rough-Fuzzy Granulation, Rough Entropy and Image Segmentation
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
Sankar K. Pal
ICS
2010
Tsinghua U.
14 years 5 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
DAC
2009
ACM
14 years 9 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
CVPR
2007
IEEE
14 years 10 months ago
Multiple Instance Learning of Pulmonary Embolism Detection with Geodesic Distance along Vascular Structure
We propose a novel classification approach for automatically detecting pulmonary embolism (PE) from computedtomography-angiography images. Unlike most existing approaches that req...
Jinbo Bi, Jianming Liang
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 8 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...