Sciweavers

4355 search results - page 118 / 871
» Increasing Kolmogorov Complexity
Sort
View
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
14 years 7 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
JMLR
2010
152views more  JMLR 2010»
14 years 4 months ago
Stochastic Composite Likelihood
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
Joshua V. Dillon, Guy Lebanon
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 15 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
159
Voted

Book
494views
16 years 8 months ago
The Little Book of Semaphores
"I wrote the first edition this book with the goal of identifying synchronization idioms and patterns that could be understood in isolation and then assembled to solve compl...
Allen B. Downey
AUTOMOTIVEUI
2009
ACM
15 years 4 months ago
Heart on the road: HRV analysis for monitoring a driver's affective state
Driving a vehicle is a task affected by an increasing number and a rising complexity of Driver Assistance Systems (DAS) resulting in a raised cognitive load of the driver, and in...
Andreas Riener, Alois Ferscha, Mohamed Aly