Sciweavers

608 search results - page 14 / 122
» Random Systems with Complete Connections
Sort
View
COLT
2008
Springer
13 years 11 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
DSN
2003
IEEE
14 years 2 months ago
TCP Server Fault Tolerance Using Connection Migration to a Backup Server
This paper describes the design, implementation, and performance evaluation of ST-TCP (Server fault-Tolerant TCP), which is an extension of TCP to tolerate TCP server failures. Th...
Manish Marwah, Shivakant Mishra, Christof Fetzer
EDBT
2006
ACM
116views Database» more  EDBT 2006»
14 years 9 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
SAGA
2007
Springer
14 years 3 months ago
Randomized Algorithms and Probabilistic Analysis in Wireless Networking
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
Aravind Srinivasan
TIT
1998
78views more  TIT 1998»
13 years 9 months ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...