Sciweavers

5153 search results - page 251 / 1031
» Introduction to Randomized Algorithms
Sort
View
CIKM
2005
Springer
15 years 9 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
FOCS
1999
IEEE
15 years 7 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
GIS
2007
ACM
15 years 7 months ago
Randomization in traffic information sharing systems
In this paper, we consider a traffic information sharing system based on Floating Car Data (FCD). FCD is one of the methods used to gather traffic information; it uses vehicles as...
Masaaki Tanizaki, Ouri Wolfson
125
Voted
TIP
2008
133views more  TIP 2008»
15 years 3 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
138
Voted
BMCBI
2005
115views more  BMCBI 2005»
15 years 3 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...