Sciweavers

4539 search results - page 785 / 908
» Approaches to Compute Workflow Complexity
Sort
View
TIP
2008
219views more  TIP 2008»
15 years 4 months ago
Binary Partition Trees for Object Detection
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...
Verónica Vilaplana, Ferran Marqués, ...
TKDE
2008
121views more  TKDE 2008»
15 years 4 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
TOG
2008
134views more  TOG 2008»
15 years 4 months ago
Fast viscoelastic behavior with thin features
We introduce a method for efficiently animating a wide range of deformable materials. We combine a high resolution surface mesh with a tetrahedral finite element simulator that ma...
Christopher Wojtan, Greg Turk
TSMC
2008
138views more  TSMC 2008»
15 years 4 months ago
Fast Diagnosis With Sensors of Uncertain Quality
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
Ozgur Erdinc, Craig Brideau, Peter Willett, Thiaga...
JSCIC
2007
89views more  JSCIC 2007»
15 years 4 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa