Sciweavers

4075 search results - page 256 / 815
» Modeling Distributed Algorithm Using B
Sort
View
SAC
2006
ACM
16 years 18 days ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
CONCUR
2003
Springer
15 years 12 months ago
Multi-Valued Model Checking via Classical Model Checking
Multi-valued model-checking is an extension of classical model-checking to reasoning about systems with uncertain information, which are common during early design stages. The addi...
Arie Gurfinkel, Marsha Chechik
TITB
2010
167views Education» more  TITB 2010»
15 years 1 months ago
Structural action recognition in body sensor networks: distributed classification based on string matching
Mobile sensor-based systems are emerging as promising platforms for healthcare monitoring. An important goal of these systems is to extract physiological information about the subj...
Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari
COLT
1995
Springer
15 years 10 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
189
Voted
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 8 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre