Sciweavers

249 search results - page 22 / 50
» Geometry and the complexity of matrix multiplication
Sort
View
IPPS
1999
IEEE
14 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 1 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
CVPR
2006
IEEE
14 years 11 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
ICCAD
2002
IEEE
113views Hardware» more  ICCAD 2002»
14 years 5 months ago
INDUCTWISE: inductance-wise interconnect simulator and extractor
Abstract—A robust, efficient, and accurate inductance extraction and simulation tool, INDUCTWISE, is developed and described in this paper. This work advances the state-of-the-ar...
Tsung-Hao Chen, Clement Luk, Hyungsuk Kim, Charlie...
COMPGEOM
1997
ACM
14 years 1 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...