Sciweavers

663 search results - page 58 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
PARELEC
2002
IEEE
14 years 18 days ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
ICCV
2009
IEEE
15 years 20 days ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
SODA
2010
ACM
163views Algorithms» more  SODA 2010»
14 years 5 months ago
Geometric optimization and sums of algebraic functions
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
Antoine Vigneron
SI3D
2003
ACM
14 years 29 days ago
Budget sampling of parametric surface patches
We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or ray-...
Jatin Chhugani, Subodh Kumar