Sciweavers

2100 search results - page 239 / 420
» Fundamentals of the problem
Sort
View
IWSOS
2007
Springer
16 years 9 hour ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
15 years 12 months ago
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
Yiyu Shi, Tong Jing, Lei He, Zhe Feng 0002, Xianlo...
168
Voted
SAC
2006
ACM
15 years 11 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
ISCA
2005
IEEE
88views Hardware» more  ISCA 2005»
15 years 11 months ago
Architecture for Protecting Critical Secrets in Microprocessors
We propose “secret-protected (SP)” architecture to enable secure and convenient protection of critical secrets for a given user in an on-line environment. Keys are examples of...
Ruby B. Lee, Peter C. S. Kwan, John Patrick McGreg...
ADC
2005
Springer
113views Database» more  ADC 2005»
15 years 11 months ago
Schemes of Storing XML Query Cache
XML query caching for XML database-backed Web applications began to be investigated recently. However, the issue of how the cached query results are stored has not been addressed ...
Hyunchul Kang, Seungchul Han, Younghyun Kim