740 search results - page 48 / 148 » An approximation ratio for biclustering |
180
click to vote
TVCG
2008
15 years 6 months ago
2008
Abstract-- Visual data comprise of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop a compact data representation technique based ...
170
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
200
click to vote
ALGORITHMICA
1998
15 years 5 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
197
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
152
click to vote
ICRA
2008
IEEE
16 years 17 days ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...