1461 search results - page 125 / 293 » Complexity of Graph Covering Problems |
106
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
117
click to vote
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
99
Voted
APVIS
2006
15 years 1 months ago
2006
In the present paper, we introduce a multi-user interactive framework for solving complex optimization problems. The framework, called Co-UserHints, provides a visual computationa...
DAC
1995
ACM
15 years 4 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
97
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...