Sciweavers

251 search results - page 11 / 51
» Using self-dissimilarity to quantify complexity
Sort
View
CSL
1999
Springer
15 years 3 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
SIGGRAPH
1996
ACM
15 years 3 months ago
Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
Jonathan Shade, Dani Lischinski, David Salesin, To...
IV
2003
IEEE
92views Visualization» more  IV 2003»
15 years 4 months ago
A Visual Formalism for Graphical User Interfaces based on State Transition Diagrams
In this paper we present a “lightweight” visual formalism that can be used to examine the state space complexity of an interface. The method can form a basis for designing, te...
Carsten Maple, Tim French, Marc Conrad
INFOCOM
2009
IEEE
15 years 6 months ago
Measuring Complexity and Predictability in Networks with Multiscale Entropy Analysis
—We propose to use multiscale entropy analysis in characterisation of network traffic and spectrum usage. We show that with such analysis one can quantify complexity and predict...
Janne Riihijärvi, Matthias Wellens, Petri M&a...
MOBIHOC
2008
ACM
15 years 11 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang