Sciweavers

30 search results - page 2 / 6
» Counting Coalescent Histories
Sort
View
AMW
2009
13 years 6 months ago
Data Expiration and Aggregate Queries
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
David Toman
IJCAI
2007
13 years 6 months ago
Inferring Long-term User Properties Based on Users' Location History
Recent development of location technologies enables us to obtain the location history of users. This paper proposes a new method to infer users’ longterm properties from their r...
Yutaka Matsuo, Naoaki Okazaki, Kiyoshi Izumi, Yosh...
ICTAC
2009
Springer
13 years 2 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
VLDB
2008
ACM
140views Database» more  VLDB 2008»
14 years 5 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao
EJC
2006
13 years 5 months ago
Counting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Remco van der Hofstad, Joel Spencer