Sciweavers

568 search results - page 60 / 114
» New bounds for the Cebysev functional
Sort
View
SIGGRAPH
1992
ACM
13 years 11 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
MST
2011
200views Hardware» more  MST 2011»
13 years 2 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
ICCV
2009
IEEE
15 years 19 days ago
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 4 months ago
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...
Yevgeniy Vahlis
CVPR
2010
IEEE
14 years 4 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler