Sciweavers

463 search results - page 58 / 93
» The lattice dimension of a graph
Sort
View
NIPS
2008
15 years 7 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
SIAMCOMP
2000
66views more  SIAMCOMP 2000»
15 years 5 months ago
Computations of Uniform Recurrence Equations Using Minimal Memory Size
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
PODC
2005
ACM
15 years 11 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
PODC
2006
ACM
16 years 2 days ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap