Sciweavers

554 search results - page 12 / 111
» Power Domination Problem in Graphs
Sort
View
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
ICDCS
2010
IEEE
13 years 7 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
ISCAS
1999
IEEE
93views Hardware» more  ISCAS 1999»
13 years 12 months ago
Problems of computing Lyapunov exponents in power electronics
Ideal power converters are governed by differential equations with discontinuous right-hand sides. General-purpose algorithms to compute their Lyapunov exponents assume smooth equ...
Y. H. Lim, D. C. Hamill
ISVC
2009
Springer
14 years 2 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 9 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002