Sciweavers

763 search results - page 108 / 153
» Engineering Shortest Path Algorithms
Sort
View
CN
2007
89views more  CN 2007»
13 years 9 months ago
Determining an appropriate sending rate over an underutilized network path
Determining an appropriate sending rate when beginning data transmission into a network with unknown characteristics is a fundamental issue in best-effort networks. Traditionally,...
Pasi Sarolahti, Mark Allman, Sally Floyd
CODES
2007
IEEE
14 years 4 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 11 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
ICIP
2008
IEEE
14 years 4 months ago
Breast contour detection with shape priors
Breast cancer conservative treatment (BCCT) is considered the gold standard of breast cancer treatment. However, aesthetic results are heterogeneous and difficult to evaluate in ...
Ricardo Sousa, Jaime S. Cardoso, Joaquim F. Pinto ...
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...