Sciweavers

400 search results - page 68 / 80
» Derandomization and Distinguishing Complexity
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 12 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
AOSD
2010
ACM
15 years 6 months ago
Execution levels for aspect-oriented programming
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if p...
Éric Tanter
ATAL
2009
Springer
15 years 6 months ago
Using rituals to express cultural differences in synthetic characters
There is currently an ongoing demand for richer Intelligent Virtual Environments (IVEs) populated with social intelligent agents. As a result, many agent architectures are taking ...
Samuel Mascarenhas, João Dias, Nuno Afonso,...
94
Voted
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 6 months ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
ICC
2007
IEEE
130views Communications» more  ICC 2007»
15 years 6 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...