2570 search results - page 319 / 514 » Fast Algorithms For The Computation Of Ranklets |
164
Voted
TVCG
2011
14 years 10 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
172
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
NETCOOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without ...
144
click to vote
RT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form...
125
Voted
CG
2008
Springer
15 years 5 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...