Sciweavers

1469 search results - page 154 / 294
» Approximate polynomial decomposition
Sort
View
MVA
2010
296views Computer Vision» more  MVA 2010»
15 years 3 months ago
Non-contact 3D acquisition system based on stereo vision and laser triangulation
Abstract This paper proposes a novel contact 3D acquisition system based on stereo vision and laser triangulation. The system is composed by several software modules for data acqui...
João L. Vilaça, Jaime C. Fonseca, An...
144
Voted
FOCS
2007
IEEE
15 years 11 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
16 years 5 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
144
Voted
ICCAD
2004
IEEE
151views Hardware» more  ICCAD 2004»
16 years 1 months ago
Dynamic range estimation for nonlinear systems
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm
119
Voted
DM
2008
96views more  DM 2008»
15 years 5 months ago
Generating 3-vertex connected spanning subgraphs
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...