1018 search results - page 135 / 204 » On the minimization of XPath queries |
154
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
DEXAW
2005
IEEE
15 years 5 months ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
CAV
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
In this paper, an efficient video content representation is proposed using optimal extraction of characteristic frames and scenes. This representation, apart from providing browsi...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract-- A large amount of the world's data is both sequential and imprecise. Such data is commonly modeled as Markovian streams; examples include words/sentences inferred f...