Sciweavers

1439 search results - page 193 / 288
» Fast approximation of centrality
Sort
View
ECCV
2010
Springer
14 years 3 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
ISBI
2002
IEEE
14 years 3 months 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
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 2 months ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
ICDE
2010
IEEE
750views Database» more  ICDE 2010»
14 years 2 months ago
Efficient and accurate discovery of patterns in sequence datasets
Existing sequence mining algorithms mostly focus on mining for subsequences. However, a large class of applications, such as biological DNA and protein motif mining, require effici...
Avrilia Floratou, Sandeep Tata, Jignesh M. Patel
EURODAC
1994
IEEE
141views VHDL» more  EURODAC 1994»
14 years 2 months ago
Exact path sensitization in timing analysis
of a direct implementation of this criterion. This paper presents the first critical path finding tool based on the exact criterion. It offers therefore better results in compariso...
R. Peset Llopis