Sciweavers

865 search results - page 148 / 173
» Random graph models for the web graph
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 8 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
147
Voted
CVPR
2009
IEEE
16 years 11 months ago
Observe Locally, Infer Globally: a Space-Time MRF for Detecting Abnormal Activities with Incremental Updates
We propose a space-time Markov Random Field (MRF) model to detect abnormal activities in video. The nodes in the MRF graph correspond to a grid of local regions in the video fra...
Jaechul Kim (University of Texas at Austin), Krist...
150
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
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...
Han Cai, Do Young Eun
EPEW
2005
Springer
15 years 9 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
ERCIMDL
2004
Springer
180views Education» more  ERCIMDL 2004»
15 years 9 months ago
Next Generation Search Interfaces - Interactive Data Exploration and Hypothesis Formulation
To date, the majority of Web search engines have provided simple keyword search interfaces that present the results as a ranked list of hyperlinks. More recently researchers have b...
Jane Hunter, Katya Falkovych, Suzanne Little