Sciweavers

13603 search results - page 253 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
FGCS
2008
127views more  FGCS 2008»
15 years 6 months ago
Monte Carlo methods for matrix computations on the grid
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
Simon Branford, Cihan Sahin, Ashish Thandavan, Chr...
GRID
2006
Springer
15 years 6 months ago
Personal Workspace for Large-Scale Data-Driven Computational Experiment
1 -- As the scale and complexity of data-driven computational science grows, so grows the burden on the scientists and students in managing the data products used and generated dur...
Yiming Sun, Scott Jensen, Sangmi Lee Pallickara, B...
CAISE
2010
Springer
15 years 5 months ago
Search Computing Systems
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Stefano Ceri, Marco Brambilla
FOCS
1998
IEEE
15 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov