Sciweavers

28 search results - page 2 / 6
» The Structure and Complexity of Sports Elimination Numbers
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 9 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
ECCV
1994
Springer
14 years 6 months ago
Recursive Affine Structure and Motion from Image Sequences
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
Philip F. McLauchlan, Ian D. Reid, David W. Murray
ISCA
2011
IEEE
271views Hardware» more  ISCA 2011»
12 years 8 months ago
CRIB: consolidated rename, issue, and bypass
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
Erika Gunadi, Mikko H. Lipasti
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 6 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
CIKM
1994
Springer
13 years 9 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet