Sciweavers

830 search results - page 46 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
IMC
2004
ACM
14 years 2 months ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...
ICRA
2007
IEEE
164views Robotics» more  ICRA 2007»
14 years 3 months ago
Real Time Biologically-Inspired Depth Maps from Spherical Flow
— We present a strategy for generating real-time relative depth maps of an environment from optical flow, under general motion. We achieve this using an insect-inspired hemisphe...
Chris McCarthy, Nick Barnes, Mandyam Srinivasan
MICCAI
2009
Springer
13 years 10 months ago
Optimal Graph Search Segmentation Using Arc-weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...
CN
2004
98views more  CN 2004»
13 years 8 months ago
On selection of candidate paths for proportional routing
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
Srihari Nelakuditi, Zhi-Li Zhang, David Hung-Chang...