145 search results - page 24 / 29 » Mining closed relational graphs with connectivity constraint... |
CN
2006
14 years 11 months ago
2006
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
TIT
2008
14 years 11 months ago
2008
Abstract--We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H0 : PXY against H1 : PXPY ...
102
click to vote
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
JAIR
2008
14 years 11 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...