Sciweavers

5158 search results - page 301 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
KDD
2004
ACM
127views Data Mining» more  KDD 2004»
16 years 7 months ago
A generative probabilistic approach to visualizing sets of symbolic sequences
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
Peter Tiño, Ata Kabán, Yi Sun
CHI
2004
ACM
16 years 7 months ago
FingerSense: augmenting expressiveness to physical pushing button by fingertip identification
In this paper, we propose a novel method, FingerSense to enhance the expressiveness of physical buttons. In a FingerSense enabled input device, a pressing action is differentiated...
Jingtao Wang, John F. Canny
POPL
2007
ACM
16 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
POPL
2004
ACM
16 years 7 months ago
Separation and information hiding
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
Peter W. O'Hearn, Hongseok Yang, John C. Reynolds
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 7 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin