Sciweavers

1469 search results - page 287 / 294
» Approximate polynomial decomposition
Sort
View
95
Voted
VISUALIZATION
2002
IEEE
15 years 2 months ago
Level-Set Segmentation From Multiple Non-Uniform Volume Datasets
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
Ken Museth, David E. Breen, Leonid Zhukov, Ross T....
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 2 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 1 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
EMSOFT
2007
Springer
15 years 1 months ago
A unified practical approach to stochastic DVS scheduling
This paper deals with energy-aware real-time system scheduling using dynamic voltage scaling (DVS) for energy-constrained embedded systems that execute variable and unpredictable ...
Ruibin Xu, Rami G. Melhem, Daniel Mossé