Sciweavers

1095 search results - page 179 / 219
» Preprocessing of Intractable Problems
Sort
View
IPPS
2006
IEEE
14 years 5 months ago
Lossless compression for large scale cluster logs
The growing computational and storage needs of several scientific applications mandate the deployment of extreme-scale parallel machines, such as IBM’s Blue Gene/L which can acc...
R. Balakrishnan, Ramendra K. Sahoo
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
14 years 5 months ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu
VRST
2005
ACM
14 years 4 months ago
Search and transitioning for motion captured sequences
Animators today have started using motion captured (mocap) sequences to drive characters. Mocap allows rapid acquisition of highly realistic animation data. Consequently animators...
Suddha Basu, Shrinath Shanbhag, Sharat Chandran
SCALESPACE
2005
Springer
14 years 4 months ago
Image Deblurring in the Presence of Salt-and-Pepper Noise
The problem of image deblurring in the presence of salt and pepper noise is considered. Standard image deconvolution algorithms, that are designed for Gaussian noise, do not perfor...
Leah Bar, Nir A. Sochen, Nahum Kiryati
SPIRE
2005
Springer
14 years 4 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi