Sciweavers

447 search results - page 29 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
ICML
2006
IEEE
14 years 8 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
ECSQARU
2009
Springer
14 years 9 days ago
Inference from Multinomial Data Based on a MLE-Dominance Criterion
We consider the problem of inference from multinomial data with chances θ, subject to the a-priori information that the true parameter vector θ belongs to a known convex polytope...
Alessio Benavoli, Cassio P. de Campos
ENTCS
2008
105views more  ENTCS 2008»
13 years 7 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 27 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ISQED
2003
IEEE
113views Hardware» more  ISQED 2003»
14 years 28 days ago
Using Integer Equations for High Level Formal Verification Property Checking
This paper describes the use of integer equations for high level modeling digital circuits for application of formal verification properties at this level. Most formal verificatio...
Bijan Alizadeh, Mohammad Reza Kakoee