1951 search results - page 133 / 391 » An algorithm for improving graph partitions |
123
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
121
click to vote
ICIP
2009
IEEE
16 years 5 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
135
click to vote
KCAP
2003
ACM
15 years 9 months ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
120
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
ACL
2009
15 years 2 months ago
2009
With the aim to deal with sentiment-transfer problem, we proposed a novel approach, which integrates the sentiment orientations of documents into the graph-ranking algorithm. We a...