Sciweavers

321 search results - page 45 / 65
» Partitioning by iterative deletion
Sort
View
IACR
2011
149views more  IACR 2011»
12 years 8 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
CVPR
2010
IEEE
14 years 4 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
14 years 3 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo
IMR
2003
Springer
14 years 2 months ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
EUROPAR
1998
Springer
14 years 1 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer