Sciweavers

994 search results - page 129 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
15 years 4 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
111
Voted
NDSS
2005
IEEE
15 years 6 months ago
Privacy-Preserving Friends Troubleshooting Network
— Content sharing is a popular use of peer-to-peer systems because of their inherent scalability and low cost of maintenance. In this paper, we leverage this nature of peer-topee...
Qiang Huang, Helen J. Wang, Nikita Borisov
97
Voted
IPTPS
2004
Springer
15 years 6 months ago
Friends Troubleshooting Network: Towards Privacy-Preserving, Automatic Troubleshooting
Abstract— Content sharing is a popular usage of peerto-peer systems for its inherent scalability and low cost of maintenance. In this paper, we leverage this nature of peer-to-pe...
Helen J. Wang, Yih-Chun Hu, Chun Yuan, Zheng Zhang...
93
Voted
ICPR
2008
IEEE
16 years 1 months ago
A method of feature selection using contribution ratio based on boosting
AdaBoost and support vector machines (SVM) algorithms are commonly used in the field of object recognition. As classifiers, their classification performance is sensitive to affect...
Masamitsu Tsuchiya, Hironobu Fujiyoshi
99
Voted
COLT
2005
Springer
15 years 6 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth