168 search results - page 21 / 34 » Abstract Interpretation for Worst and Average Case Analysis |
SPIRE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
107
click to vote
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
110
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and application...
114
click to vote
GLOBECOM
2008
IEEE
14 years 12 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
CISS
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—The theoretical analysis of randomized compressive operators often relies on the existence of a concentration of measure inequality for the operator of interest. Though ...