Sciweavers

7047 search results - page 144 / 1410
» Focusing on Binding and Computation
Sort
View
SP
1987
IEEE
118views Security Privacy» more  SP 1987»
15 years 10 months ago
A Comparison of Commercial and Military Computer Security Policies
Most discussions of computer security focus on control of disclosure. In Particular, the U.S. Department of Defense has developed a set of criteria for computer mechanisms to prov...
D. D. Clark, D. R. Wilson
AAAI
2006
15 years 7 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
UAI
2001
15 years 7 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
IJIIDS
2008
95views more  IJIIDS 2008»
15 years 6 months ago
Tightly-coupled GIS data in GNSS fix computations with integrity testing
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
Clément Fouque, Philippe Bonnifait
JPDC
2006
156views more  JPDC 2006»
15 years 6 months ago
Grid harvest service: A performance system of grid computing
Conventional performance evaluation mechanisms focus on dedicated systems. Grid computing infrastructure, on the other hand, is a shared collaborative environment constructed on v...
Ming Wu, Xian-He Sun