Sciweavers

1392 search results - page 275 / 279
» A Calculus for Dynamic Linking
Sort
View
CCR
2002
102views more  CCR 2002»
13 years 7 months ago
DNS performance and the effectiveness of caching
This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advance...
Jaeyeon Jung, Emil Sit, Hari Balakrishnan, Robert ...
NAR
2000
132views more  NAR 2000»
13 years 7 months ago
The Eukaryotic Promoter Database (EPD)
The Eukaryotic Promoter Database (EPD) is an annotated non-redundant collection of experimentally characterised eukaryotic POL II promoters. The underlying definition of a promote...
Rouaïda Cavin Périer, Viviane Praz, Th...
TAPOS
1998
93views more  TAPOS 1998»
13 years 7 months ago
Object Acquaintance Selection and Binding
Large object-oriented systems have, at least, four characteristics that complicate object communication, i.e the system is distributed and contains large numbers, e.g. thousands, ...
Jan Bosch
COMCOM
2007
149views more  COMCOM 2007»
13 years 7 months ago
Adaptive security design with malicious node detection in cluster-based sensor networks
Distributed wireless sensor networks have problems on detecting and preventing malicious nodes, which always bring destructive threats and compromise multiple sensor nodes. Theref...
Meng-Yen Hsieh, Yueh-Min Huang, Han-Chieh Chao
NAS
2010
IEEE
13 years 6 months ago
CR: Capability Information for Routing of Wireless Ad Hoc Networks in the Real Environment
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu