Sciweavers

6974 search results - page 1144 / 1395
» Querying Semi-Structured Data
Sort
View
126
Voted
DAMON
2006
Springer
15 years 4 months ago
Processing-in-memory technology for knowledge discovery algorithms
The goal of this work is to gain insight into whether processingin-memory (PIM) technology can be used to accelerate the performance of link discovery algorithms, which represent ...
Jafar Adibi, Tim Barrett, Spundun Bhatt, Hans Chal...
123
Voted
ER
2006
Springer
137views Database» more  ER 2006»
15 years 4 months ago
Preference Functional Dependencies for Managing Choices
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
Wilfred Ng
109
Voted
KDD
2000
ACM
147views Data Mining» more  KDD 2000»
15 years 4 months ago
A self organizing map (SOM) extended model for information discovery in a digital library context
This paper presents the MicroNOMAD Discovering Tool. Its main characteristic is both to provide an user with emergent analyses of a multimedia database content and with querying a...
Jean-Charles Lamirel, Jacques Ducloy, Hager Kammou...
121
Voted
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 4 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
99
Voted
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
15 years 4 months ago
Resource-Bounded Information Extraction: Acquiring Missing Feature Values on Demand
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
Pallika Kanani, Andrew McCallum, Shaohan Hu
« Prev « First page 1144 / 1395 Last » Next »