Sciweavers

1038 search results - page 89 / 208
» Space-Bounded Query Approximation
Sort
View
127
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 2 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 8 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
155
Voted
JUCS
2010
152views more  JUCS 2010»
14 years 9 months ago
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
Michal Konecný, Amin Farjudian
110
Voted
SIGIR
2009
ACM
15 years 9 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song
105
Voted
VMCAI
2007
Springer
15 years 8 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman