Sciweavers

4850 search results - page 127 / 970
» Approximate Data Structures with Applications
Sort
View
MDM
2004
Springer
113views Communications» more  MDM 2004»
15 years 3 months ago
Meta Data to Support Context Aware Mobile Applications
The greater sophistication and availability of mobile computing devices is enabling the application of computing to new tasks and applications to be experienced in a wide range of...
Dan Chalmers, Naranker Dulay, Morris Sloman
SIBGRAPI
2008
IEEE
15 years 4 months ago
Approximations by Smooth Transitions in Binary Space Partitions
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone...
IPL
2011
91views more  IPL 2011»
14 years 5 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
ISBI
2008
IEEE
15 years 10 months ago
Fast displacement probability profile approximation from HARDI using 4th-order tensors
Cartesian tensor basis have been widely used to approximate spherical functions. In Medical Imaging, tensors of various orders have been used to model the diffusivity function in ...
Angelos Barmpoutis, Baba C. Vemuri, John R. Forder
WWW
2007
ACM
15 years 10 months ago
A unified platform for data driven web applications with automatic client-server partitioning
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
Fan Yang 0002, Nitin Gupta 0003, Nicholas Gerner, ...