Sciweavers

1124 search results - page 117 / 225
» Generalized Conditioning in Neighbourhood Models
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 13 days ago
RFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
Ajay Gulati, Peter J. Varman
IANDC
2000
64views more  IANDC 2000»
14 years 11 months ago
Bisimilarity of Open Terms
The standard way of lifting a binary relation, R, from closed terms of an algebra to open terms is to de ne its closed-instance extension, Rci, which holds for a given pair of ope...
Arend Rensink
ICCV
2009
IEEE
14 years 9 months ago
Simultaneous photometric invariance and shape recovery
In this paper we identify the constraints under which the generally ill-posed problem of the simultaneous recovery of surface shape and its photometric invariants can be rendered ...
Cong Phuoc Huynh, Antonio Robles-Kelly
RTAS
2002
IEEE
15 years 4 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...
INFOCOM
2007
IEEE
15 years 5 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano