Results 1  10
of
623
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
, 2014
"... We consider the budget allocation problem over bipartite influence model proposed by Alon et al. (Alon et al., 2012). This problem can be viewed as the wellknown influence maximization problem with budget constraints. We first show that this problem and its much more general form fall into a genera ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider the budget allocation problem over bipartite influence model proposed by Alon et al. (Alon et al., 2012). This problem can be viewed as the wellknown influence maximization problem with budget constraints. We first show that this problem and its much more general form fall into a
Maximizing the Spread of Influence Through a Social Network
 In KDD
, 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in gametheoretic settings, and the effects of ..."
Abstract

Cited by 990 (7 self)
 Add to MetaCart
the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63 % of optimal for several classes of models; our framework suggests a general approach
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract

Cited by 360 (0 self)
 Add to MetaCart
. Clustering is achieved by removing arcs of G to form mutually exclusive subgraphs such that the largest intersubgraph maximum flow is minimized. For graphs of moderate size ( 2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of 6, which can be efficiently
Delay Budget Allocation for DelayGuaranteed Network Paths
"... Algorithms for provisioning virtual circuits or virtual private networks with quality of service guarantees typically attempt to optimize the resource usage of the underlying networks. The key technique used is to choose network routes so as to balance the loads on the underlying network's link ..."
Abstract
 Add to MetaCart
's links and routers. Standard routing protocols can be viewed as a restricted instance of such network load balancing techniques. For network paths with delay guarantee, there is a separate dimension along which network resource provision algorithms can optimize to increase resource usage efficiency: end
Resource allocation of securitycritical tasks with statistically guaranteed energy constraint
 in Embedded and RealTime Computing Systems and Appl. (RTCSA
"... ABSTRACT—In this paper, we are interested in resource allocation for energy constrained and securitycritical embedded systems. Tasks in such systems need to be successfully executed under certain energy budget and be robust against serious security threatens. Different to former energy minimal sche ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
scheduling problem, we introduce a new optimization problem for a set of tasks with energy constraint and multiple security choices. We present a dynamic programming based approximation algorithm to minimize the security risk of the system while statistically guaranteeing energy consumption constraints
An Asynchronous Complete Method for Distributed Constraint Optimization
 In AAMAS
, 2003
"... We present a new polynomialspace algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multiagent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to pr ..."
Abstract

Cited by 132 (30 self)
 Add to MetaCart
to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a userspecified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains
On efficient and almost budget balanced allocation mechanisms
, 2008
"... We consider two resource allocation problems where one dimensional mechanisms achieve allocative efficiency in equilibrium under quasilinear preferences, but are unable to balance the budget. We define the efficiency loss of a mechanism as its largest ratio of budget imbalance to efficient surplus, ..."
Abstract
 Add to MetaCart
We consider two resource allocation problems where one dimensional mechanisms achieve allocative efficiency in equilibrium under quasilinear preferences, but are unable to balance the budget. We define the efficiency loss of a mechanism as its largest ratio of budget imbalance to efficient surplus
Fairness and Load Balancing in Wireless LANs Using Association Control
"... Recent studies on operational wireless LANs (WLANs) have shown that the traffic load is often unevenly distributed among the access points (APs). Such load imbalance results in unfair bandwidth allocation among users. We argue that the load imbalance and consequent unfair bandwidth allocation can ..."
Abstract

Cited by 157 (3 self)
 Add to MetaCart
be greatly alleviated by intelligently associating users to APs, termed association control, rather than having users associate with the APs of strongest signal strength. In this paper, we present an efficient algorithmic solution to determine the userAP associations for maxmin fair bandwidth allocation
CommunicationEfficient Algorithms for Statistical Optimization
"... We study two communicationefficient algorithms for distributed statistical optimization on largescale data. The first algorithm is an averaging method that distributes the N data samples evenly to m machines, performs separate minimization on each subset, and then averages the estimates. We provid ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
We study two communicationefficient algorithms for distributed statistical optimization on largescale data. The first algorithm is an averaging method that distributes the N data samples evenly to m machines, performs separate minimization on each subset, and then averages the estimates. We
Exploiting duality in summarization with deterministic guarantees
 In Proc. of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, 2007
"... Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixedspace synopses that provide a deterministic quality guarantee, often expressed in terms of a maximumerror metric. Histograms and several hierarchical techniques h ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
algorithm reduces time complexity by (at least) a B log 2 n log ∗ factor and our hierarchical synopsis algorithm reduces the complexity by (at least) a factor of log 2 B log ∗+logn in time andB(1 − logBlogn) in space, where ∗ is the optimal error. These complexity advantages offer both a spaceefficiency
Results 1  10
of
623