Sciweavers

74 search results - page 11 / 15
» A note on the size of minimal covers
Sort
View
NETWORKS
2007
14 years 9 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
UIST
1998
ACM
15 years 2 months ago
A Negotiation Architecture for Fluid Documents
The information presented in a document often consists of primary content as well as supporting material such as explanatory notes, detailed derivations, illustrations, and the li...
Bay-Wei Chang, Jock D. Mackinlay, Polle Zellweger,...
NIPS
2007
14 years 11 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...
TCS
2008
14 years 9 months ago
The Magnus-Derek game
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...
Zhivko Prodanov Nedev, S. Muthukrishnan
HPCC
2007
Springer
15 years 3 months ago
A Generic Minimum Dominating Forward Node Set Based Service Discovery Protocol for MANETs
Abstract. Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Pr...
Zhen-guo Gao, Sheng Liu, Mei Yang, Jinhua Zhao, Ji...