Sciweavers

948 search results - page 100 / 190
» What can we achieve by arbitrary announcements
Sort
View
CL
2010
Springer
13 years 9 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr
NIPS
2008
13 years 10 months ago
Unlabeled data: Now it helps, now it doesn't
Empirical evidence shows that in favorable situations semi-supervised learning (SSL) algorithms can capitalize on the abundance of unlabeled training data to improve the performan...
Aarti Singh, Robert D. Nowak, Xiaojin Zhu
ICASSP
2011
IEEE
13 years 20 days ago
Anti-aliasing filter for subpixel down-sampling based on frequency analysis
Nowadays, digital pictures are usually captured at very high resolution ranged up to 12 mega-pixels. Limited by low-resolution display, we have to shrink the image. Signal process...
Lu Fang, Ketan Tang, Oscar C. Au, Aggelos K. Katsa...
TOG
2012
188views Communications» more  TOG 2012»
11 years 11 months ago
Deformable objects alive!
We present a method for controlling the motions of active deformable characters. As an underlying principle, we require that all motions be driven by internal deformations. We ach...
Stelian Coros, Sebastian Martin, Bernhard Thomasze...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 6 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd