Sciweavers

1466 search results - page 251 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
OOPSLA
2007
Springer
15 years 3 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
14 years 9 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 2 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
NAACL
1994
14 years 11 months ago
Multilingual Speech Databases at LDC
As multilingual products and technology grow in importance, the Linguistic Data Consortium (LDC) intends to provide the resources needed for research and development activities, e...
John J. Godfrey