Sciweavers

191 search results - page 34 / 39
» Online Aggregation over Trees
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Peer-to-Peer utility maximization
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
Minghua Chen, Sudipta Sengupta, Miroslav Ponec, Ph...
DOLAP
2000
ACM
14 years 1 days ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
FOCS
1995
IEEE
13 years 11 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
KDD
2009
ACM
183views Data Mining» more  KDD 2009»
14 years 8 months ago
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more ...
Bin Zhou 0002, Daxin Jiang, Jian Pei, Hang Li
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 2 months ago
Stochastic mobility-based path planning in uncertain environments
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
Gaurav Kewlani, Genya Ishigami, Karl Iagnemma