Sciweavers

2303 search results - page 407 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
CASES
2001
ACM
14 years 1 months ago
Combined partitioning and data padding for scheduling multiple loop nests
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
Zhong Wang, Edwin Hsing-Mean Sha, Xiaobo Hu
BMVC
2002
14 years 19 hour ago
Using Points at Infinity for Parameter Decoupling in Camera Calibration
We consider the problem of decoupling translation and rotation for a collection of 3D data related to 2D images by a projection. The main contribution is to show that equations de...
Jean-Yves Guillemaut, Alberto S. Aguado, John Illi...
ACMDIS
2008
ACM
13 years 11 months ago
Exploring true multi-user multimodal interaction over a digital table
True multi-user, multimodal interaction over a digital table lets co-located people simultaneously gesture and speak commands to control an application. We explore this design spa...
Edward Tse, Saul Greenberg, Chia Shen, Clifton For...
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
13 years 11 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco