Sciweavers

244 search results - page 10 / 49
» Compressive PCA on Graphs
Sort
View
ICDE
2003
IEEE
211views Database» more  ICDE 2003»
15 years 10 days ago
Capturing Sensor-Generated Time Series with Quality Guarantees
We are interested in capturing time series generated by small wireless electronic sensors. Battery-operated sensors must avoid heavy use of their wireless radio which is a key cau...
Iosif Lazaridis, Sharad Mehrotra
WWW
2010
ACM
14 years 4 months ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
14 years 4 months ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink
EVOW
2010
Springer
14 years 4 months ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...
WEBI
2005
Springer
14 years 4 months ago
HITS is Principal Components Analysis
In this work, we show that Kleinberg’s hubs and authorities model (HITS) is simply Principal Components Analysis (PCA; maybe the most widely used multivariate statistical analys...
Marco Saerens, François Fouss