Sciweavers

845 search results - page 26 / 169
» Connecting Many-Sorted Theories
Sort
View
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 3 months ago
Helly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Éric Colin de Verdière, Grégo...
DBPL
2007
Springer
102views Database» more  DBPL 2007»
14 years 2 months ago
A Theory of Stream Queries
Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predi...
Yuri Gurevich, Dirk Leinders, Jan Van den Bussche
INFOCOM
1997
IEEE
14 years 20 days ago
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
Roch Guérin, Ariel Orda
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 8 months ago
A Theory of Network Equivalence
We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can...
Ralf Koetter, Michelle Effros, Muriel Médar...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications
Abstract—In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified frame...
Martin Haenggi