1285 search results - page 66 / 257 » On the Complexity of Ordinal Clustering |
JGTOOLS
2008
13 years 9 months ago
2008
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
SOCA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex function...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we explore a new clustering approach for reducing the complexity of wide issue in-order processors based on EPIC architectures. Complexity effectiveness is achieved ...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...