Sciweavers

462 search results - page 1 / 93
» Covering a Tree by a Forest
Sort
View
BIRTHDAY
2009
Springer
13 years 11 months ago
Covering a Tree by a Forest
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
Fanica Gavril, Alon Itai
ACL
2011
12 years 8 months ago
Binarized Forest to String Translation
Tree-to-string translation is syntax-aware and efficient but sensitive to parsing errors. Forestto-string translation approaches mitigate the risk of propagating parser errors in...
Hao Zhang, Licheng Fang, Peng Xu, Xiaoyun Wu
RT
2004
Springer
13 years 10 months ago
Rendering Forest Scenes in Real-Time
Forests are crucial for scene realism in applications such as flight simulators. This paper proposes a new representation allowing for the real-time rendering of realistic forest...
Philippe Decaudin, Fabrice Neyret
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 5 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
DEBS
2007
ACM
13 years 6 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma