Sciweavers

1414 search results - page 145 / 283
» Randomness and Universal Machines
Sort
View
112
Voted
FUIN
2010
268views more  FUIN 2010»
14 years 7 months ago
Boruta - A System for Feature Selection
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...
196
Voted
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 2 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
95
Voted
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
15 years 6 months ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
90
Voted
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 4 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
80
Voted
CCCG
2010
15 years 2 months ago
On stretch minimization problem on unit strip paper
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
Ryuhei Uehara