Sciweavers

2950 search results - page 327 / 590
» Computing with Infinitely Many Processes
Sort
View
ICIP
2008
IEEE
16 years 8 months ago
Coding-gain-based complexity control for H.264 video encoder
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
Ming-Chen Chien, Zong-Yi Chen, Pao-Chi Chang
CHI
2005
ACM
16 years 7 months ago
Connecting with kids: so what's new?
From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install...
Lori L. Scarlatos, Amy Bruckman, Allison Druin, Mi...
FOCS
2007
IEEE
16 years 29 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
16 years 1 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 2 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson