10608 search results - page 387 / 2122 » Complexity of O'Hara's Algorithm |
149
click to vote
ADHOC
2010
15 years 29 days ago
2010
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors wit...
135
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
154
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
140
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
146
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...