2283 search results - page 435 / 457 » Bounds of Graph Characteristics |
126
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
140
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
128
click to vote
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
108
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
121
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...