2137 search results - page 315 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
164
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
186
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
176
click to vote
ICPADS
1994
IEEE
15 years 9 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
174
click to vote
PR
2008
15 years 4 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
146
click to vote
JAT
2010
15 years 3 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...