Sciweavers

1696 search results - page 139 / 340
» Permuted function matching
Sort
View
SIAMJO
2008
104views more  SIAMJO 2008»
14 years 11 months ago
A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
Seung-Jean Kim, Stephen P. Boyd
71
Voted
PR
2000
130views more  PR 2000»
14 years 10 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
221
Voted
ICFP
2012
ACM
13 years 1 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy
125
Voted
ICALP
2005
Springer
15 years 4 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
132
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 4 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...