1259 search results - page 167 / 252 » Efficient Wire Formats for High Performance Computing |
149
click to vote
CGF
2010
15 years 4 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
137
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Most methods for object class segmentation are formulated as a labelling problem over a single choice of quantisation of an image space - pixels, segments or group of segments. It...
148
click to vote
PPL
2010
14 years 11 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
142
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
145
click to vote
IWCC
1999
IEEE
15 years 8 months ago
1999
IEEE
The recent improvements in workstation and interconnection network performance have popularized the clusters of off-the-shelf workstations. However, the usefulness of these cluste...