Sciweavers

1136 search results - page 118 / 228
» Finding Small Holes
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
CHI
2009
ACM
14 years 9 months ago
Touch and toys: new techniques for interaction with a remote group of robots
Interaction with a remote team of robots in real time is a difficult human-robot interaction (HRI) problem exacerbated by the complications of unpredictable realworld environments...
Cheng Guo, James Everett Young, Ehud Sharlin
CHES
2009
Springer
141views Cryptology» more  CHES 2009»
14 years 9 months ago
Fault Attacks on RSA Signatures with Partially Unknown Messages
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
Jean-Sébastien Coron, Antoine Joux, Ilya Ki...
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 9 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
14 years 9 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal