121 search results - page 18 / 25 » Upper Bounds on Number of Steals in Rooted Trees |
110
Voted
ERSHOV
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
69
Voted
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
98
Voted
PODS
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
GFKL
2007
Springer
15 years 1 months ago
2007
Springer
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...