Sciweavers

2996 search results - page 180 / 600
» Numberings and Randomness
Sort
View
CORR
2012
Springer
193views Education» more  CORR 2012»
14 years 2 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
ESORICS
2003
Springer
15 years 11 months ago
Rapid Mixing and Security of Chaum's Visual Electronic Voting
Recently, David Chaum proposed an electronic voting scheme that combines visual cryptography and digital processing. It was designed to meet not only mathematical security standard...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 7 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ECSQARU
2009
Springer
16 years 1 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
ICOST
2009
Springer
16 years 1 months ago
Pervasive Informatics and Persistent Actimetric Information in Health Smart Homes
This paper discuss the ability to obtain a reliable pervasive information at home from a network of localizing sensors allowing to follow the different locations at which a depend...
Yannick Fouquet, Nicolas Vuillerme, Jacques Demong...