Sciweavers

447 search results - page 24 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
PAKDD
2009
ACM
94views Data Mining» more  PAKDD 2009»
14 years 6 days ago
Item Preference Parameters from Grouped Ranking Observations
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
Hideitsu Hino, Yu Fujimoto, Noboru Murata
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 11 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
CORR
2007
Springer
140views Education» more  CORR 2007»
13 years 7 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
CAV
2007
Springer
108views Hardware» more  CAV 2007»
14 years 1 months ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena
QEST
2010
IEEE
13 years 5 months ago
Automatic Compositional Reasoning for Probabilistic Model Checking of Hardware Designs
Adaptive techniques like voltage and frequency scaling, process variations and the randomness of input data contribute signi cantly to the statistical aspect of contemporary hardwa...
Jayanand Asok Kumar, Shobha Vasudevan