Sciweavers

534 search results - page 104 / 107
» Efficient polynomial L-approximations
Sort
View
SIGMOD
2009
ACM
139views Database» more  SIGMOD 2009»
14 years 8 months ago
Detecting and resolving unsound workflow views for correct provenance analysis
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
Peng Sun, Ziyang Liu, Susan B. Davidson, Yi Chen
INFOCOM
2008
IEEE
14 years 2 months ago
A Practical and Flexible Key Management Mechanism For Trusted Collaborative Computing
—Trusted Collaborative Computing (TCC) is a new research and application paradigm. Two important challenges in such a context are represented by secure information transmission a...
Xukai Zou, Yuan-Shun Dai, Elisa Bertino
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
CVPR
2004
IEEE
14 years 9 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...
ICCV
1999
IEEE
14 years 9 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos