Sciweavers

3630 search results - page 271 / 726
» Fast Marching Methods
Sort
View
TCAD
2010
90views more  TCAD 2010»
15 years 1 months ago
Fast, Nearly Optimal ISE Identification With I/O Serialization Through Maximal Clique Enumeration
The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user ...
Ajay K. Verma, Philip Brisk, Paolo Ienne
SIAMSC
2011
140views more  SIAMSC 2011»
14 years 9 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...
CATA
2000
15 years 7 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
JMLR
2010
111views more  JMLR 2010»
15 years 1 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
CVPR
2012
IEEE
13 years 9 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff