Sciweavers

518 search results - page 81 / 104
» Beating a Random Assignment
Sort
View
COMCOM
2007
103views more  COMCOM 2007»
15 years 2 months ago
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...
Kin-Hon Ho, Michael P. Howarth, Ning Wang, George ...
IJCSA
2006
95views more  IJCSA 2006»
15 years 2 months ago
Modeling and Formal Verification of DHCP Using SPIN
The Dynamic Host Configuration Protocol (DHCP) is a widely used communication protocol. In this paper, a portion of the protocol is chosen for modeling and verification, namely th...
Syed M. S. Islam, Mohammed H. Sqalli, Sohel Khan
IVC
2008
138views more  IVC 2008»
15 years 2 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
JCP
2008
126views more  JCP 2008»
15 years 2 months ago
Content-Based Computer Simulation of a Networking Course: An Assessment
This paper presents a successful lab simulation experience to teach signal modulation and demodulation concepts in communication and computer networks to computer science and compu...
Giti Javidi, Ehsan Sheybani
ITA
2006
163views Communications» more  ITA 2006»
15 years 2 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...