Sciweavers

14165 search results - page 606 / 2833
» The generalized two-server problem
Sort
View
ICIP
2003
IEEE
16 years 8 months ago
Variational Beltrami flows over manifolds
We study, in this paper, the problem of denoising images/data which are defined over non-flat surfaces. This problem arises often in many medical imaging tasks. The Beltrami flow ...
Nir A. Sochen, Rachid Deriche, Lucero Lopez Perez
WWW
2009
ACM
16 years 7 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
CADE
2009
Springer
16 years 7 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 7 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer