8695 search results - page 206 / 1739 » Making the Complex Simple |
155
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
212
click to vote
DMKD
2004
ACM
16 years 14 hour ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...
203
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
165
click to vote
STOC
1989
ACM
15 years 10 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
183
click to vote
RTSS
2000
IEEE
15 years 10 months ago
2000
IEEE
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...