5606 search results - page 237 / 1122 » Randomization Techniques for Graphs. |
120
click to vote
TSP
2008
15 years 22 days ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
108
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
119
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we focus on the design of Markov Chain Monte Carlo techniques in a statistical registration framework based on finite element basis (FE). Due to the use of FE basis...
219
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
109
Voted
DBISP2P
2004
Springer
15 years 6 months ago
2004
Springer
We present the InfoBeacons system, in which a peer-to-peer network of beacons cooperates to route queries to the best information sources. The routing in our system uses techniques...