Sciweavers

6266 search results - page 16 / 1254
» New results on the computability and complexity of points - ...
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Fixed Point Probability Field for Complex Occlusion Handling
In this paper, we show that in a multi-camera context, we can effectively handle occlusions in real-time at each frame independently, even when the only available data comes from ...
François Fleuret, Pascal Fua, Richard Lenga...
BMCBI
2010
277views more  BMCBI 2010»
13 years 7 months ago
PCA2GO: a new multivariate statistics based method to identify highly expressed GO-Terms
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
Marc Bruckskotten, Mario Looso, Franz Cemic, Anne ...
ARITH
2009
IEEE
13 years 11 months ago
A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
Claude-Pierre Jeannerod, Herve Knochel, Christophe...
EOR
2008
69views more  EOR 2008»
13 years 7 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
11 years 10 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright