Sciweavers

191 search results - page 8 / 39
» Online Aggregation over Trees
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
VLDB
1999
ACM
133views Database» more  VLDB 1999»
13 years 12 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
VLDB
2007
ACM
161views Database» more  VLDB 2007»
14 years 8 months ago
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
14 years 1 months ago
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
Kun Zhang, Zujia Xu, Jing Peng, Bill P. Buckles