2323 search results - page 237 / 465 » Power optimization for connectivity problems |
122
click to vote
NIPS
2001
15 years 5 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
155
click to vote
PPSN
2010
Springer
15 years 2 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
132
click to vote
ECCV
1998
Springer
16 years 6 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
147
click to vote
SAMOS
2007
Springer
15 years 10 months ago
2007
Springer
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
154
click to vote
SERVICES
2010
14 years 11 months ago
2010
Abstract--Mobile devices such as smart phones are increasing permeating society. With strides in computational power, coupled with the ability to connect to other small devices, sm...