Sciweavers

17049 search results - page 23 / 3410
» cans 2007
Sort
View
SMC
2007
IEEE
122views Control Systems» more  SMC 2007»
14 years 1 months ago
Can complexity science support the engineering of critical network infrastructures?
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
David Alderson, John C. Doyle
EUSAI
2007
Springer
14 years 1 months ago
How Computer Vision Can Help in Outdoor Positioning
Localization technologies have been an important focus in ubiquitous computing. This paper explores an underrepresented area, namely computer vision technology, for outdoor positio...
Ulrich Steinhoff, Dusan Omercevic, Roland Perko, B...
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
USENIX
2007
13 years 9 months ago
Events Can Make Sense
Tame is a new event-based system for managing concurrency in network applications. Code written with Tame abstractions does not suffer from the “stackripping” problem associat...
Maxwell N. Krohn, Eddie Kohler, M. Frans Kaashoek
DCG
2007
91views more  DCG 2007»
13 years 7 months ago
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of conve...
Jeremy Carroll, Frank Ruskey, Mark Weston