Sciweavers

3652 search results - page 715 / 731
» A study of query length
Sort
View
CASCON
1997
91views Education» more  CASCON 1997»
13 years 9 months ago
Keeping virtual information resources up and running
The maintenanceofmaterializedviews in largescale environments composed of numerous heterogeneous information sources ISs, such as the WWW, has importance for the new breed of in...
Amy J. Lee, Anisoara Nica, Elke A. Rundensteiner
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 9 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
ATAL
2010
Springer
13 years 8 months ago
History-dependent graphical multiagent models
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
Quang Duong, Michael P. Wellman, Satinder P. Singh...
CIDR
2009
181views Algorithms» more  CIDR 2009»
13 years 8 months ago
The Case for RodentStore: An Adaptive, Declarative Storage System
Recent excitement in the database community surrounding new applications--analytic, scientific, graph, geospatial, etc.--has led to an explosion in research on database storage sy...
Philippe Cudré-Mauroux, Eugene Wu, Samuel M...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe