Sciweavers

439 search results - page 44 / 88
» Unnesting Arbitrary Queries
Sort
View
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 2 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
ICDT
1995
ACM
79views Database» more  ICDT 1995»
14 years 1 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
JASIS
2000
120views more  JASIS 2000»
13 years 9 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
ISB
2002
140views more  ISB 2002»
13 years 9 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
ICASSP
2011
IEEE
13 years 1 months ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld