Sciweavers

1094 search results - page 36 / 219
» One Size Fits All
Sort
View
COCOC
1995
150views Combinatorics» more  COCOC 1995»
14 years 1 months ago
On Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke
ML
2008
ACM
13 years 10 months ago
Incremental exemplar learning schemes for classification on embedded devices
Although memory-based classifiers offer robust classification performance, their widespread usage on embedded devices is hindered due to the device's limited memory resources...
Ankur Jain, Daniel Nikovski
PARCO
1997
13 years 11 months ago
Parallel Database Techniques in Decision Support and Data Mining
During the last decade, all commercial database systems have included features for parallel processing into their products. This development has been driven by the fact that datab...
Andreas Reuter
CG
2008
Springer
13 years 10 months ago
Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 10 months ago
Unbiased Matrix Rounding
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classic...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...