1161 search results - page 170 / 233 » Approximation schemes for clustering problems |
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
ICRA
2009
IEEE
13 years 5 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...
DIALM
2003
ACM
14 years 27 days ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
CCR
2000
13 years 7 months ago
2000
TCP congestion control 9] is designed for network stability, robustness and opportunistic use of network bu er and bandwidth resources on an end-to-end per-connection basis. Upon ...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three ...