721 search results - page 117 / 145 » Bounds on the k-domination number of a graph |
121
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
139
click to vote
PODS
1999
ACM
15 years 4 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
102
click to vote
WINET
2010
14 years 10 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
110
click to vote
TMC
2011
14 years 6 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
134
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...