2553 search results - page 177 / 511 » Modeling Trees with Hypertextures |
153
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
136
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
270
click to vote
GIS
2004
ACM
16 years 4 months ago
2004
ACM
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
143
Voted
TABLEAUX
1999
Springer
15 years 8 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
140
click to vote
IWDC
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an a...