Sciweavers

4095 search results - page 601 / 819
» How to test a tree
Sort
View
LCPC
2007
Springer
14 years 2 months ago
Modeling Relations between Inputs and Dynamic Behavior for General Programs
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
Xipeng Shen, Feng Mao
PAM
2007
Springer
14 years 2 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
SMALLTALK
2007
Springer
14 years 2 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 2 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
INFOCOM
2006
IEEE
14 years 2 months ago
Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks
— The distribution of broadcast TV across large provider networks has become a highly topical subject as satellite distribution capacity exhausts and competitive pressures increa...
Meeyoung Cha, Wanpracha Art Chaovalitwongse, Zihui...