Sciweavers

14515 search results - page 471 / 2903
» Efficient Embedded Computing
Sort
View
TPHOL
2002
IEEE
16 years 17 days ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
194
Voted
COMGEO
2007
ACM
15 years 7 months ago
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
Daniel Freedman
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
15 years 7 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
MM
2010
ACM
145views Multimedia» more  MM 2010»
15 years 5 months ago
A GPU-accelerated face annotation system for smartphones
Face annotation makes it easy to share and manage digital photos and videos. While state-of-the-art face recognition algorithms can achieve high accuracy to support automatic face...
Yi-Chu Wang, Sydney Pang, Kwang-Ting Cheng
246
Voted
CVPR
2011
IEEE
15 years 3 months ago
Iterative Quantization: A Procrustean Approach to Learning Binary Codes
This paper addresses the problem of learning similaritypreserving binary codes for efficient retrieval in large-scale image collections. We propose a simple and efficient altern...
Yunchao Gong, Svetlana Lazebnik