Sciweavers

3096 search results - page 246 / 620
» Theory and Use of the EM Algorithm
Sort
View
COMPGEOM
2003
ACM
15 years 11 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
COMPGEOM
2009
ACM
16 years 1 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 6 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
ICNC
2005
Springer
16 years 2 days ago
Credit Rating Analysis with AFS Fuzzy Logic
In this paper, we propose a new machine learning approach based on AFS (Axiomatic Fuzzy Sets) fuzzy logic, in attempt to provide a better model with interpretability. First, we wil...
Xiaodong Liu, Wanquan Liu
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady