Sciweavers

4103 search results - page 188 / 821
» Some results on the Collatz problem
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Estimating the performance of hypothetical cloud service deployments: A measurement-based approach
To optimize network performance, cloud service providers have a number of options available to them, including co-locating production servers in well-connected Internet eXchange (...
Angela Wang, Cheng Huang, Jin Li, Keith W. Ross
SIGMETRICS
2000
ACM
144views Hardware» more  SIGMETRICS 2000»
15 years 6 months ago
Bistro: a framework for building scalable wide-area Upload applications
Hot spots are a major obstacle to achieving scalability in the Internet. At the application layer, hot spots are usually caused by either (a) high demand for some data or (b) high...
Samrat Bhattacharjee, William C. Cheng, Cheng-Fu C...
AROBOTS
1998
130views more  AROBOTS 1998»
15 years 6 months ago
Rough Terrain Autonomous Mobility-Part 2: An Active Vision, Predictive Control Approach
Off-road autonomous navigation is one of the most difficult automation challenges from the point of view of constraints on mobility, speed of motion, lack of environmental structur...
Alonzo Kelly, Anthony Stentz
PAMI
2002
149views more  PAMI 2002»
15 years 6 months ago
Region Tracking via Level Set PDEs without Motion Computation
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
Abdol-Reza Mansouri
JCS
2008
109views more  JCS 2008»
15 years 6 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...