6575 search results - page 827 / 1315 » Specializing visualization algorithms |
170
click to vote
JCP
2008
15 years 6 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
162
click to vote
DAM
2007
15 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
164
click to vote
DKE
2007
15 years 6 months ago
2007
Finding interaction patterns is a challenging problem, but this kind of information about processes or social networks might be useful for an organization’s management to unders...
129
click to vote
JMLR
2006
15 years 6 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...