Sciweavers

101 search results - page 15 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 7 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
ISBI
2002
IEEE
14 years 10 days ago
A shape reconstruction method for diffuse optical tomography using a transport model and level sets
A two-step shape reconstruction method for diffuse optical tomography (DOT) is presented which uses adjoint fields and level sets. The propagation of near-infrared photons in tis...
O. Dorn
CVPR
2003
IEEE
14 years 9 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum
CVPR
1997
IEEE
13 years 11 months ago
Completion Energies and Scale
ÐThe detection of smooth curves in images and their completion over gaps are two important problems in perceptual grouping. In this study, we examine the notion of completion ener...
Eitan Sharon, Achi Brandt, Ronen Basri
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
14 years 1 months ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand