2907 search results - page 137 / 582 » Presentations of Structures in Admissible Sets |
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a novel approach for learning nonlinear dynamic models, which leads to a new set of tools capable of solving problems that are otherwise difficult. We provide theory sh...
95
Voted
CAV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...
122
click to vote
ANOR
2006
15 years 27 days ago
2006
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
109
Voted
RELMICS
1998
Springer
15 years 5 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
102
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...