Sciweavers

948 search results - page 140 / 190
» What can we achieve by arbitrary announcements
Sort
View
ALT
1999
Springer
14 years 1 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
CGF
2008
108views more  CGF 2008»
13 years 9 months ago
Robust and Efficient Wave Simulations on Deforming Meshes
The goal of this paper is to enable the interactive simulation of phenomena such as animated fluid characters. While full 3D fluid solvers achieve this with control algorithms, th...
Roland Angst, Nils Thürey, Mario Botsch, Mark...
ER
2007
Springer
111views Database» more  ER 2007»
14 years 3 months ago
Provability-Based Semantic Interoperability Via Translation Graphs
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
Joshua Taylor, Andrew Shilliday, Selmer Bringsjord
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
14 years 1 months ago
Fair watermarking techniques
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
ICC
2007
IEEE
14 years 3 months ago
Optimal Distributed Multicast Routing using Network Coding
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Yi Cui, Yuan Xue, Klara Nahrstedt