406 search results - page 22 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
ICMLA
2008
14 years 11 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
100
click to vote
SAC
2003
ACM
15 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
74
Voted
VVS
1998
IEEE
15 years 1 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...