951 search results - page 112 / 191 » On the Computation of Correctly-Rounded Sums |
162
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
112
Voted
SI3D
2009
ACM
15 years 11 months ago
2009
ACM
Efficient visibility queries are key in many interactive rendering techniques, such as occlusion culling, level of detail determination, and perceptual rendering. The occlusion q...
117
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
121
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
126
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...