Sciweavers

16430 search results - page 491 / 3286
» On Computable Tree Functions
Sort
View
NAR
2011
238views Computer Vision» more  NAR 2011»
15 years 1 months ago
COMBREX: a project to accelerate the functional annotation of prokaryotic genomes
COMBREX (http://combrex.bu.edu) is a project to increase the speed of the functional annotation of new bacterial and archaeal genomes. It consists of a database of functional pred...
Richard J. Roberts, Yi-Chien Chang, Zhenjun Hu, Jo...
ICCV
2009
IEEE
16 years 12 months ago
An Algorithm for Minimizing the Piecewise Smooth Mumford-Shah Functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algori...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICPR
2004
IEEE
16 years 8 months ago
Image Retrieval by Local Evaluation of Nonlinear Kernel Functions around Salient Points
Feature histograms based on the evaluation of Haar integrals with nonlinear kernel functions were used successfully for the purpose of invariant content based image retrieval. In ...
Alaa Halawani, Hans Burkhardt
DAGSTUHL
2008
15 years 8 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
CC
2005
Springer
118views System Software» more  CC 2005»
15 years 6 months ago
The complexity of constructing pseudorandom generators from hard functions
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
Emanuele Viola