Sciweavers

221 search results - page 42 / 45
» Efficient sampling of random permutations
Sort
View
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 8 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
ISCC
2002
IEEE
122views Communications» more  ISCC 2002»
14 years 23 days ago
Efficiency/friendliness tradeoffs in TCP Westwood
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
14 years 4 months ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar
TON
2008
87views more  TON 2008»
13 years 7 months ago
Large-scale network parameter configuration using an on-line simulation framework
As the Internet infrastructure grows to support a variety of services, its legacy protocols are being overloaded with new functions such as traffic engineering. Today, operators en...
Tao Ye, Hema Tahilramani Kaur, Shivkumar Kalyanara...
CVPR
2007
IEEE
14 years 10 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang