865 search results - page 123 / 173 » Random graph models for the web graph |
151
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
120
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
145
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
140
click to vote
IJCV
2012
13 years 6 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
134
click to vote
GEOS
2007
Springer
15 years 10 months ago
2007
Springer
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...