Sciweavers

182 search results - page 33 / 37
» A Theory of Strict P-completeness
Sort
View
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 7 months ago
Asynchronous Bounded Expected Delay Networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
FSS
2008
110views more  FSS 2008»
13 years 7 months ago
Learning valued preference structures for solving classification problems
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
Eyke Hüllermeier, Klaus Brinker
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
The source coding game with a cheating switcher
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
Hari Palaiyanur, Cheng Chang, Anant Sahai
IJRR
2006
76views more  IJRR 2006»
13 years 7 months ago
From Robots to Animals: Virtual Fences for Controlling Cattle
We consider the problem of monitoring and controlling the position of herd animals, and view animals as agents with natural mobility but not strictly controllable. By exploiting k...
Zack J. Butler, Peter I. Corke, Ronald A. Peterson...
CORR
2007
Springer
176views Education» more  CORR 2007»
13 years 7 months ago
Crystallization in large wireless networks
—We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K...
Veniamin I. Morgenshtern, Helmut Bölcskei