Sciweavers

242 search results - page 40 / 49
» An Efficient Method for Indexing Now-relative Bitemporal dat...
Sort
View
ICDE
2003
IEEE
117views Database» more  ICDE 2003»
14 years 8 months ago
Design and Implementation of a Temporal Extension of SQL
We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...
Cindy Xinmin Chen, Jiejun Kong, Carlo Zaniolo
ICML
2005
IEEE
14 years 7 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
NIPS
2004
13 years 8 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
VIP
2000
13 years 8 months ago
Cataloging and Search Engine for Video Library
The paper describes a prototype of cataloging and search engine for video library, the Video Library Search Engine (VLSE). We propose the system based on our codification of video...
Henry C. Wang, David Dagan Feng, Jesse S. Jin
TCS
2008
13 years 6 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq