553 search results - page 52 / 111 » Cover Contact Graphs |
DLT
2006
15 years 1 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
102
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ASUNAM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
111
click to vote
INFORMATICALT
2008
15 years 15 days ago
2008
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....