Sciweavers

4850 search results - page 142 / 970
» Approximate Data Structures with Applications
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
14 years 10 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
IPPS
2007
IEEE
15 years 4 months ago
A Performance Prediction Framework for Grid-Based Data Mining Applications
For a grid middleware to perform resource allocation, prediction models are needed, which can determine how long an application will take for completion on a particular platform o...
Leonid Glimcher, Gagan Agrawal
CBMS
2006
IEEE
15 years 4 months ago
A Framework for Web-Based Interactive Applications of High-Resolution 3D Medical Image Data
With the advances in medical imaging devices, large volumes of high-resolution 3D medical image data have been produced. These high-resolution 3D data are very large in size, and ...
Danzhou Liu, Kien A. Hua, Kiminobu Sugaya
ICS
2009
Tsinghua U.
15 years 2 months ago
A translation system for enabling data mining applications on GPUs
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...
Wenjing Ma, Gagan Agrawal
COMPGEOM
2004
ACM
15 years 3 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato