Sciweavers

154 search results - page 11 / 31
» Space efficient dynamic stabbing with fast queries
Sort
View
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 10 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
TCAD
2008
65views more  TCAD 2008»
13 years 10 months ago
Fashion: A Fast and Accurate Solution to Global Routing Problem
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Zhe Feng...
DAMON
2008
Springer
14 years 4 days ago
CAM conscious integrated answering of frequent elements and top-k queries over data streams
Frequent elements and top-k queries constitute an important class of queries for data stream analysis applications. Certain applications require answers for both frequent elements...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
JCNS
2010
90views more  JCNS 2010»
13 years 5 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
CIDM
2007
IEEE
14 years 2 months ago
An Efficient Distance Calculation Method for Uncertain Objects
Recently the academic communities have paid more attention to the queries and mining on uncertain data. In the tasks such as clustering or nearest-neighbor queries, expected distan...
Lurong Xiao, Edward Hung