Sciweavers

19320 search results - page 224 / 3864
» On the complexity of computing determinants
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
ECCV
2006
Springer
16 years 8 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
INFOCOM
1997
IEEE
15 years 10 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
DATE
2008
IEEE
66views Hardware» more  DATE 2008»
16 years 1 months ago
Optimal Margin Computation for At-Speed Test
— In the face of increased process variations, at-speed manufacturing test is necessary to detect subtle delay defects. This procedure necessarily tests chips at a slightly highe...
Jinjun Xiong, Vladimir Zolotov, Chandu Visweswaria...