Sciweavers

847 search results - page 28 / 170
» Approximation algorithms for projective clustering
Sort
View
CORR
2007
Springer
131views Education» more  CORR 2007»
14 years 11 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
ICML
2004
IEEE
15 years 12 months ago
Automated hierarchical mixtures of probabilistic principal component analyzers
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...
Ting Su, Jennifer G. Dy
VMV
2007
178views Visualization» more  VMV 2007»
15 years 6 days ago
Filtered Blending: A new, minimal Reconstruction Filter for Ghosting-Free Projective Texturing with Multiple Images
Whenever approximate 3D geometry is projectively texture-mapped from different directions simultaneously, annoyingly visible aliasing artifacts are the result. To prevent such gho...
Martin Eisemann, Marcus A. Magnor
FMCAD
2006
Springer
15 years 2 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
DATAMINE
2006
89views more  DATAMINE 2006»
14 years 11 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh