Sciweavers

921 search results - page 39 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
TSP
2010
14 years 10 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
VLDB
1990
ACM
106views Database» more  VLDB 1990»
15 years 7 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
SIGMOD
2009
ACM
219views Database» more  SIGMOD 2009»
16 years 4 months ago
Hermes: a travel through semantics on the data web
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Che...
WWW
2008
ACM
16 years 4 months ago
StYLiD: Social Information Sharing with Free Creation of Structured Linked Data
Information sharing can be effective with structured data. The Semantic Web is mainly aimed at structuring information by creating widely accepted ontologies. However, users have ...
Aman Shakya, Hideaki Takeda, Vilas Wuwongse
PODS
1997
ACM
182views Database» more  PODS 1997»
15 years 8 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...