CORR
2010
Springer
13 years 7 months ago
2010
Springer
: Real-time databases deal with time-constrained data and time-constrained transactions. The design of
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when ch...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...