Sciweavers

2767 search results - page 347 / 554
» Universal Exponentiation Algorithm
Sort
View
CGF
2008
100views more  CGF 2008»
15 years 6 months ago
Distortion-Free Steganography for Polygonal Meshes
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...
Alexander Bogomjakov, Craig Gotsman, Martin Isenbu...
COGSCI
2007
99views more  COGSCI 2007»
15 years 6 months ago
Language Evolution by Iterated Learning With Bayesian Agents
Languages are transmitted from person to person and generation to generation via a process of iterated learning: people learn a language from other people who once learned that la...
Thomas L. Griffiths, Michael L. Kalish
TIP
2002
93views more  TIP 2002»
15 years 6 months ago
Joint source-channel coding for motion-compensated DCT-based SNR scalable video
In this paper, we develop an approach toward joint source-channel coding for motion-compensated DCT-based scalable video coding and transmission. A framework for the optimal select...
Lisimachos P. Kondi, Faisal Ishtiaq, Aggelos K. Ka...
COLING
2010
15 years 1 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 10 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov