Sciweavers

280 search results - page 39 / 56
» Distributed Approximation Algorithms for Planar Graphs
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan
SACMAT
2006
ACM
14 years 2 months ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 21 days ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 10 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro