Sciweavers

333 search results - page 43 / 67
» Read-Once Functions and Query Evaluation in Probabilistic Da...
Sort
View
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 4 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
BMCBI
2007
164views more  BMCBI 2007»
15 years 3 months ago
Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks
Background: The regulation of gene expression is achieved through gene regulatory networks (GRNs) in which collections of genes interact with one another and other substances in a...
Peng Li, Chaoyang Zhang, Edward J. Perkins, Ping G...
EDBTW
2004
Springer
15 years 8 months ago
Clustering Structured Web Sources: A Schema-Based, Model-Differentiation Approach
Abstract. The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data– Th...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
146
Voted
EDBT
2004
ACM
143views Database» more  EDBT 2004»
16 years 3 months ago
OGSA-DQP: A Service for Distributed Querying on the Grid
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...
M. Nedim Alpdemir, Arijit Mukherjee, Anastasios Go...
229
Voted
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 3 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li