Sciweavers

15485 search results - page 426 / 3097
» Computing Optimal Subsets
Sort
View
ITCC
2000
IEEE
15 years 11 months ago
Parallel Real-Time Numerical Computation: Beyond Speedup III
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
Selim G. Akl, Stefan D. Bruda
TOG
2008
134views more  TOG 2008»
15 years 6 months ago
Computing geometry-aware handle and tunnel loops in 3D models
Many applications such as topology repair, model editing, surface parameterization, and feature recognition benefit from computing loops on surfaces that wrap around their `handle...
Tamal K. Dey, Kuiyu Li, Jian Sun, David Cohen-Stei...
ICIP
2005
IEEE
16 years 8 months ago
Efficient neighborhood-based computations on regions using scans
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
Alain Mérigot, Bertrand Ducourthial, Nicola...
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
16 years 8 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
ICCD
2002
IEEE
88views Hardware» more  ICCD 2002»
16 years 3 months ago
Improving Processor Performance by Simplifying and Bypassing Trivial Computations
During the course of a program’s execution, a processor performs many trivial computations; that is, computations that can be simplified or where the result is zero, one, or equ...
Joshua J. Yi, David J. Lilja