Sciweavers

762 search results - page 29 / 153
» Finding Facilities Fast
Sort
View
84
Voted
ICIP
2001
IEEE
15 years 11 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
72
Voted
ICIP
2000
IEEE
15 years 11 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
85
Voted
DAC
1999
ACM
15 years 10 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
67
Voted
ICML
2005
IEEE
15 years 10 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
74
Voted
KDD
2009
ACM
151views Data Mining» more  KDD 2009»
15 years 10 months ago
A LRT framework for fast spatial anomaly detection
Given a spatial data set placed on an n ? n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithm...
Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ran...