Sciweavers

7129 search results - page 21 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 7 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
IJCM
2008
72views more  IJCM 2008»
15 years 7 months ago
ROMAN DOMINATION: a parameterized perspective
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
Henning Fernau
INFOCOM
2012
IEEE
13 years 10 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 10 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
AAAI
2006
15 years 9 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan