28888 search results - page 274 / 5778 » Computability and complexity in analysis |
180
click to vote
INFOVIS
2003
IEEE
15 years 12 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
161
click to vote
ICPR
2010
IEEE
15 years 12 months ago
2010
IEEE
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
181
click to vote
NAACL
2010
15 years 4 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
181
click to vote
GD
2005
Springer
16 years 5 days ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
195
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...