697 search results - page 78 / 140 » On the Theory of Average Case Complexity |
URBAN
2008
13 years 7 months ago
2008
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
ATMOS
2010
13 years 7 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
KDD
2010
ACM
13 years 6 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
CASES
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we introduce Optimus: an optimizing synthesis compiler for streaming applications. Optimus compiles programs written in a high level streaming language to either so...