365 search results - page 60 / 73 » On the combinatorics of Galois numbers |
106
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
106
click to vote
VISUALIZATION
2003
IEEE
15 years 5 months ago
2003
IEEE
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
103
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
JCB
2008
14 years 11 months ago
2008
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...