Sciweavers

181 search results - page 31 / 37
» On the Number of Errors Correctable with Codes on Graphs
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 7 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
ICRA
2007
IEEE
163views Robotics» more  ICRA 2007»
14 years 1 months ago
Implementing a Control System Framework for Automatic Generation of Manufacturing Cell Controllers
— Quickly adapting the manufacturing system to the production of new or modified products is critical for manufacturers in order to stay competitive. For flexible manufacturing...
Oscar Ljungkrantz, Knut Akesson, Johan Richardsson...
MLDM
2007
Springer
14 years 25 days ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 10 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
TSE
2008
99views more  TSE 2008»
13 years 6 months ago
Modular Information Hiding and Type-Safe Linking for C
This paper presents CMOD, a novel tool that provides a sound module system for C. CMOD works by enforcing a set of four rules that are based on principles of modular reasoning and...
Saurabh Srivastava, Michael Hicks, Jeffrey S. Fost...