19320 search results - page 301 / 3864 » On the complexity of computing determinants |
176
click to vote
AMC
2007
15 years 6 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
159
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
177
Voted
CCCG
2009
15 years 4 months ago
2009
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
153
click to vote
IPPS
2005
IEEE
16 years 8 days ago
2005
IEEE
We study the energy efficiency benefits of bypassing trivial computations in high-performance processors. Trivial computations are those computations whose output can be determine...
217
click to vote
CVPR
2009
IEEE
17 years 28 days ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...