Sciweavers

1383 search results - page 104 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
NSF
1994
Springer
151views Computer Vision» more  NSF 1994»
15 years 10 months ago
Algebraic Geometry and Object Representation in Computer Vision
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...
Sylvain Petitjean
AUSAI
2006
Springer
15 years 10 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert
IMAGING
2004
15 years 7 months ago
Maintaining an Accurate Printer Characterization
In this study, the problem of updating a printer characterization in response to systematic changes in print-device characteristics is addressed with two distinct approaches: the ...
David Littlewood, Ganesh Subbarayan
WSCG
2004
157views more  WSCG 2004»
15 years 7 months ago
Efficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
Roland Perko, Horst Bischof
CONCUR
2010
Springer
15 years 6 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini