Sciweavers

1359 search results - page 97 / 272
» Probabilistic Points-to Analysis
Sort
View
ICALP
1994
Springer
15 years 8 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
ICALP
1992
Springer
15 years 8 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
SIGIR
2010
ACM
15 years 7 months ago
Personalize web search results with user's location
We build a probabilistic model to identify implicit local intent queries, and leverage user’s physical location to improve Web search results for these queries. Evaluation on co...
Yumao Lu, Fuchun Peng, Xing Wei, Benoît Dumo...
CG
2006
Springer
15 years 7 months ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
111
Voted
WSC
2007
15 years 6 months ago
Analyzing air combat simulation results with dynamic Bayesian networks
In this paper, air combat simulation data is reconstructed into a dynamic Bayesian network. It gives a compact probabilistic model that describes the progress of air combat and al...
Jirka Poropudas, Kai Virtanen