Sciweavers

198 search results - page 24 / 40
» Dynamic spatial approximation trees
Sort
View
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 10 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
ATAL
2009
Springer
14 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
ICPR
2010
IEEE
14 years 4 months ago
Integrating a Discrete Motion Model into GMM Based Background Subtraction
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
Christian Wolf, Jolion Jolion
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 11 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
INFOCOM
1999
IEEE
14 years 2 months ago
Scalable Flow Control for Multicast ABR Services
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Ka...