Sciweavers

3702 search results - page 155 / 741
» All Pairings Are in a Group
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 6 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
DCG
2010
104views more  DCG 2010»
15 years 3 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
DM
2008
110views more  DM 2008»
15 years 6 months ago
A novel algorithm enumerating bent functions
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
Qingshu Meng, Min Yang, Huanguo Zhang, Jingsong Cu...
EDCC
2008
Springer
15 years 8 months ago
A Distributed Approach to Autonomous Fault Treatment in Spread
This paper presents the design and implementation of the Distributed Autonomous Replication Management (DARM) framework built on top of the Spread group communication system. The ...
Hein Meling, Joakim L. Gilje
MM
1996
ACM
128views Multimedia» more  MM 1996»
15 years 10 months ago
The Case for Reliable Concurrent Multicasting Using Shared Ack Trees
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable diss...
Brian Neil Levine, David B. Lavo, J. J. Garcia-Lun...