2254 search results - page 152 / 451 » Computing the minimal covering set |
138
click to vote
ROBVIS
2001
Springer
15 years 11 months ago
2001
Springer
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
732
click to vote
Presentation
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
167
click to vote
ACSC
2005
IEEE
16 years 6 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
152
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...
148
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...