17541 search results - page 442 / 3509 » Complexity in scalable computing |
158
click to vote
TCS
2010
15 years 28 days ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
178
click to vote
GRID
2000
Springer
15 years 9 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
140
click to vote
EPIA
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
154
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This article presents a multi-agent dialogue system. We show how a collection of relatively simple agents is able to treat complex dialogue phenomena and deal successfully with di...
158
click to vote
MAGS
2007
15 years 6 months ago
2007
Abstract. The availability of massive amounts of biological data, distributed in various data sources, has prompted the development of a wide range of data analysis tools. However,...