Sciweavers

5793 search results - page 1048 / 1159
» Individual communication complexity
Sort
View
JIRS
2010
120views more  JIRS 2010»
13 years 8 months ago
Simple and Robust Attainment of Transparency Based on Two-Channel Control Architectures Using Time-Delay Control
Abstract This paper investigates simple and robust transparency-attainable control architectures for bilateral teleoperation. The strength of two-channel control architectures and ...
Jonghyun Kim, Hyung-Soon Park, Pyung Hun Chang
LATIN
2010
Springer
13 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
MOR
2010
98views more  MOR 2010»
13 years 8 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
PR
2010
129views more  PR 2010»
13 years 8 months ago
Parsimonious reduction of Gaussian mixture models with a variational-Bayes approach
Aggregating statistical representations of classes is an important task for current trends in scaling up learning and recognition, or for addressing them in distributed infrastruc...
Pierrick Bruneau, Marc Gelgon, Fabien Picarougne
PVLDB
2010
152views more  PVLDB 2010»
13 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
« Prev « First page 1048 / 1159 Last » Next »