Sciweavers

1091 search results - page 96 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
VISUALIZATION
1997
IEEE
14 years 2 days ago
Multiresolution tetrahedral framework for visualizing regular volume data
We present a multiresolution framework, called Multi-Tetra framework, that approximates volume data with different levelsof-detail tetrahedra. The framework is generated through a...
Yong Zhou, Baoquan Chen, Arie E. Kaufman
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 9 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
DIALM
2003
ACM
99views Algorithms» more  DIALM 2003»
14 years 1 months ago
Spatio-temporal data reduction with deterministic error bounds
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Hu Cao, Ouri Wolfson, Goce Trajcevski
WIDM
2004
ACM
14 years 1 months ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...
BMCBI
2007
237views more  BMCBI 2007»
13 years 8 months ago
FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data
Background: Data clustering analysis has been extensively applied to extract information from gene expression profiles obtained with DNA microarrays. To this aim, existing cluster...
Limin Fu, Enzo Medico