Sciweavers

2034 search results - page 309 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
PAMI
2012
11 years 10 months ago
Image Restoration by Matching Gradient Distributions
—The restoration of a blurry or noisy image is commonly performed with a MAP estimator, which maximizes a posterior probability to reconstruct a clean image from a degraded image...
Taeg Sang Cho, Charles Lawrence Zitnick, Neel Josh...
VIS
2004
IEEE
136views Visualization» more  VIS 2004»
14 years 9 months ago
Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
Jinzhu Gao, Han-Wei Shen, Jian Huang, James Arthur...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SASN
2006
ACM
14 years 1 months ago
Autonomous and distributed node recovery in wireless sensor networks
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
Mario Strasser, Harald Vogt
ICPP
2008
IEEE
14 years 2 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...