Sciweavers

475 search results - page 63 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 5 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
GIS
2006
ACM
16 years 6 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 2 months ago
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
Xuan-Chao Huang, Jay Cheng
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 5 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 5 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova