Sciweavers

7593 search results - page 1277 / 1519
» Querying XML Databases
Sort
View
AAI
2007
132views more  AAI 2007»
15 years 4 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
BMCBI
2008
86views more  BMCBI 2008»
15 years 4 months ago
Subfamily specific conservation profiles for proteins based on n-gram patterns
Background: A new algorithm has been developed for generating conservation profiles that reflect the evolutionary history of the subfamily associated with a query sequence. It is ...
John K. Vries, Xiong Liu
ECCC
2006
120views more  ECCC 2006»
15 years 4 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
174
Voted
GIS
2010
ACM
15 years 3 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
244
Voted
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 6 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
« Prev « First page 1277 / 1519 Last » Next »