Sciweavers

2924 search results - page 151 / 585
» Lower Bounds in Distributed Computing
Sort
View
PG
2007
IEEE
15 years 9 months ago
Faceting Artifact Analysis for Computer Graphics
The faceting signal, defined in this paper as the difference signal between a rendering of the original geometric model and a simplified version of the geometric model, is respo...
Lijun Qu, Gary W. Meyer
IEICET
2007
131views more  IEICET 2007»
15 years 2 months ago
High Accuracy Fundamental Matrix Computation and Its Performance Evaluation
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
Ken-ichi Kanatani, Yasuyuki Sugaya
FLAIRS
2006
15 years 4 months ago
Toward a Computational Model of Expert Tutoring: A First Report
We are exploring the differences between expert and less expert tutors with two goals: cognitive (what does tutoring tell us about learning) and applied (which features of tutorin...
Barbara Di Eugenio, Trina C. Kershaw, Xin Lu, Andr...
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
15 years 28 days ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
114
Voted
RANDOM
2001
Springer
15 years 7 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...