Sciweavers

57 search results - page 10 / 12
» Hierarchical Traces for Reduced NSM Memory Requirements
Sort
View
DLS
2010
204views Languages» more  DLS 2010»
13 years 5 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
ICDCS
2012
IEEE
11 years 10 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
RT
1999
Springer
13 years 11 months ago
Face Cluster Radiosity
Abstract. An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolut...
Andrew J. Willmott, Paul S. Heckbert, Michael Garl...
COMSUR
2011
196views Hardware» more  COMSUR 2011»
12 years 7 months ago
From MANET To IETF ROLL Standardization: A Paradigm Shift in WSN Routing Protocols
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
Thomas Watteyne, Antonella Molinaro, Maria Grazia ...
IMC
2003
ACM
14 years 22 days ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk