Sciweavers

406 search results - page 29 / 82
» Dominating Sets in Web Graphs
Sort
View
DAM
2006
63views more  DAM 2006»
13 years 9 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
ACMSE
2007
ACM
14 years 1 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan
DCC
2002
IEEE
14 years 8 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
SEMWEB
2010
Springer
13 years 7 months ago
Signal/Collect: Graph Algorithms for the (Semantic) Web
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
Philip Stutz, Abraham Bernstein, William Cohen
COCOA
2009
Springer
14 years 3 months ago
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...