468 search results - page 92 / 94 » One-Way Functions in Complexity Theory |
115
click to vote
VMV
2004
15 years 1 months ago
2004
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
125
click to vote
UAI
1997
15 years 1 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
113
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
108
click to vote
CORR
2008
Springer
15 years 13 days ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
105
click to vote
AI
2006
Springer
15 years 12 days ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...