Sciweavers

633 search results - page 59 / 127
» Locality and Hard SAT-Instances
Sort
View
CN
2007
121views more  CN 2007»
13 years 10 months ago
Symbiotic rate adaptation for time sensitive elastic traffic with interactive transport
—Interactivity in the transport protocol can greatly benefit transport friendly applications generating streaming traffic. Recently we have developed iTCP, which can provide even...
Javed I. Khan, Raid Zaghal
AIR
2004
130views more  AIR 2004»
13 years 9 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 8 months ago
A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation
In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos...
T. R. Gopalakrishnan Nair, P. Jayarekha
ANOR
2011
117views more  ANOR 2011»
13 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ICCV
2011
IEEE
12 years 10 months ago
Double Window Optimisation for Constant Time Visual SLAM
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
Hauke Strasdat, Andrew J. Davison, J. M. M. Montie...