Sciweavers

259 search results - page 47 / 52
» Some New Directions and Questions in Parameterized Complexit...
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 8 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 6 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
SI3D
2003
ACM
14 years 1 months ago
Shear-image order ray casting volume rendering
This paper describes shear-image order ray casting, a new method for volume rendering. This method renders sampled data in three dimensions with image quality equivalent to the be...
Yin Wu, Vishal Bhatia, Hugh C. Lauer, Larry Seiler
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 8 months ago
A complete set of rotationally and translationally invariant features for images
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
Risi Imre Kondor