7 Hits in 2.3 sec

Page 6621 of Mathematical Reviews Vol. , Issue 2001I [page]

2001 Mathematical Reviews  
Kobourov, Polylogarithmic-overhead piecemeal graph exploration (280-286 (elecronic)); Leslie G.  ... 

Page 1986 of Mathematical Reviews Vol. , Issue Subject Index [page]

Mathematical Reviews  
Polylogarithmic-overhead piecemeal graph exploration.  ...  Exploring unknown environments. (see 20014:68025) Alexe, Gabriela (with Alexe, Sorin) The clique structure of a graph.  ... 

Page 979 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
(with Awerbuch, Baruch) Polylogarithmic-overhead piecemeal graph exploration.  ...  (Sum- mary) 2001¢:03099 03F20 (03D15, 68Q15) — (with Arvind, Vikraman) Graph isomorphism is low for ZPP(NP) and other lowness results.  ... 

Page 90 of Mathematical Reviews Vol. , Issue Author Index [page]

Mathematical Reviews  
Polylogarithmic-overhead piecemeal graph exploration.  ... 

Analysis Of Algorithms For Online Routing And Scheduling In Networks

Jessen Havill
For instance, piecemeal routing and scheduling decisions are often good because decisions are deferred until the last minute and such algorithms usually require very little overhead a t th e source.  ...  However, these algorithms require more overhead at the source and the global information may be hard to gather.  ...  We have explored several adaptations so far w ithout success. The exponential algorithm packet routing algorithm does not necessarily send a packet out on the first available route.  ... 
doi:10.21220/s2-6jma-at75 fatcat:oe7zl3szmnb4bmrdmno7iz7mry

SWAT: hierarchical stream summarization in large networks

A. Bulut, A.K. Singh
Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)  
Therefore, they propose two methods to tune the old buckets: wholesale approach and piecemeal approach.  ...  We minimize the message overhead by deciding what and where to replicate by using an adaptive replication scheme.  ...  Our future work will explore possible variations of the proposed technique in case of multiple streams.  ... 
doi:10.1109/icde.2003.1260801 dblp:conf/icde/BulutS03 fatcat:ox4alfmdh5e4bkzpflvbcbqneu

Enclave Computing Paradigm: Hardware-assisted Security Architectures & Applications

Franz Ferdinand Peter Brasser
Each row of the graph corresponds to one measurement trace for each of the ten multipliers we monitored, i. e., our t = 15 repetitions resulted in 15 rows in the graph.  ...  In particular, the spanning tree T is constructed from the communication graph of S, i. e., two devices can be neighbors in T if they are neighbors in the communication graph.  ... 
doi:10.25534/tuprints-00011912 fatcat:2xf7ax7tcvbhrn76cdvcesfj6e