2638 search results - page 355 / 528 » Random Geometric Complexes |
138
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
120
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
158
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
111
Voted
IJDAR
2010
15 years 1 months ago
2010
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
135
click to vote
TON
2010
15 years 27 days ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...