Sciweavers

6568 search results - page 264 / 1314
» Reducing the Complexity of Reductions
Sort
View
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 10 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
NSDI
2008
15 years 9 months ago
Efficiency Through Eavesdropping: Link-layer Packet Caching
The broadcast nature of wireless networks is the source of both their utility and much of their complexity. To turn what would otherwise be unwanted interference into an advantage...
Mikhail Afanasyev, David G. Andersen, Alex C. Snoe...
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
15 years 8 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 8 months ago
Feature Selection for Nonlinear Kernel Support Vector Machines
An easily implementable mixed-integer algorithm is proposed that generates a nonlinear kernel support vector machine (SVM) classifier with reduced input space features. A single ...
Olvi L. Mangasarian, Gang Kou
FORTE
1997
15 years 8 months ago
A Framework for Distributed Object-Oriented Testing
Distributed programming and object-oriented programming are two popular programming paradigms. The former is driven by advances in networking technology whereas the latter provide...
Alan C. Y. Wong, Samuel T. Chanson, Shing-Chi Cheu...