Sciweavers

948 search results - page 118 / 190
» What can we achieve by arbitrary announcements
Sort
View
IWSOS
2009
Springer
14 years 1 months ago
Self-organized Data Redundancy Management for Peer-to-Peer Storage Systems
In peer-to-peer storage systems, peers can freely join and leave the system at any time. Ensuring high data availability in such an environment is a challenging task. In this paper...
Yaser Houri, Manfred Jobmann, Thomas Fuhrmann
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 9 months ago
Real-Time Multi-path Tracking of Probabilistic Available Bandwidth
Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit...
Frederic Thouin, Mark Coates, Michael Rabbat
AI
2000
Springer
13 years 8 months ago
Towards adaptive Web sites: Conceptual framework and case study
The creation of a complex web site is a thorny problem in user interface design. In this paper we explore the notion of adaptive web sites: sites that semi-automatically improve t...
Mike Perkowitz, Oren Etzioni
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 11 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
JSC
2006
52views more  JSC 2006»
13 years 8 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn