4526 search results - page 369 / 906 » Algorithmic problems related to the Internet |
172
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
181
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
174
click to vote
COREGRID
2007
Springer
16 years 28 days ago
2007
Springer
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
181
click to vote
ESWS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
359
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...