Sciweavers

3897 search results - page 155 / 780
» complexity 2010
Sort
View
ENTCS
2002
207views more  ENTCS 2002»
13 years 10 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
DCG
2010
97views more  DCG 2010»
13 years 9 months ago
Cech Type Approach to Computing Homology of Maps
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...
Marian Mrozek
IEEEHPCS
2010
13 years 9 months ago
Scalable instruction set simulator for thousand-core architectures running on GPGPUs
Simulators are still the primary tools for development and performance evaluation of applications running on massively parallel architectures. However, current virtual platforms a...
Shivani Raghav, Martino Ruggiero, David Atienza, C...
IMCSIT
2010
13 years 8 months ago
The Polish Cyc lexicon as a bridge between Polish language and the Semantic Web
In this paper we discuss the problem of building the Polish lexicon for the Cyc ontology. As the ontology is very large and complex we describe semi-automatic translation of part o...
Aleksander Pohl
IMCSIT
2010
13 years 8 months ago
An Hypergraph Object Oriented Model for Image Segmentation and Annotation
This paper presents a system for segmentation of images into regions and annotation of these regions for semantic identification of the objects present in the image. The unified me...
Eugen Ganea, Marius Brezovan