Sciweavers

736 search results - page 126 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
CAD
2004
Springer
13 years 8 months ago
ESOLID - a system for exact boundary evaluation
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...
John Keyser, Tim Culver, Mark Foskey, Shankar Kris...
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
13 years 6 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
SDM
2012
SIAM
233views Data Mining» more  SDM 2012»
11 years 11 months ago
On Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...
Pauli Miettinen
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 9 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
POPL
2004
ACM
14 years 9 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula