1933 search results - page 117 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
128
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
107
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
135
click to vote
ICIAP
1997
ACM
15 years 8 months ago
1997
ACM
A strategy in solving the shape from shading problem for the shape and albedo recovery of book surfaces under the fully perspective environment is proposed. The whole recovery proc...
144
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
216
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...