1814 search results - page 11 / 363 » Improved Results on Geometric Hitting Set Problems |
IPCO
2004
13 years 9 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
CATA
2010
13 years 9 months ago
2010
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
JAR
2000
13 years 7 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
INFOCOM
2002
IEEE
14 years 19 days ago
2002
IEEE
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...