Sciweavers

693 search results - page 84 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
PRL
2006
85views more  PRL 2006»
15 years 1 months ago
Image segmentation based on merging of sub-optimal segmentations
In this paper a heuristic segmentation algorithm is presented based on the oversegmentation of an image. The method uses a set of different segmentations of the image produced pre...
Juan Carlos Pichel, David E. Singh, Francisco F. R...
PLDI
2010
ACM
15 years 6 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
CVPR
2000
IEEE
16 years 3 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari
FOCS
2008
IEEE
15 years 8 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
FLAIRS
2004
15 years 2 months ago
Adaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering ...
Sanjiv K. Bhatia