Sciweavers

4536 search results - page 262 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
135
Voted
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 6 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ICONIP
2004
15 years 3 months ago
Non-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee
IMSCCS
2006
IEEE
15 years 8 months ago
Clustering of Gene Expression Data: Performance and Similarity Analysis
Background: DNA Microarray technology is an innovative methodology in experimental molecular biology, which has produced huge amounts of valuable data in the profile of gene expre...
Longde Yin, Chun-Hsi Huang
EMNLP
2008
15 years 4 months ago
LTAG Dependency Parsing with Bidirectional Incremental Construction
In this paper, we first introduce a new architecture for parsing, bidirectional incremental parsing. We propose a novel algorithm for incremental construction, which can be applie...
Libin Shen, Aravind K. Joshi
ENTCS
2002
72views more  ENTCS 2002»
15 years 2 months ago
A Symbolic Out-of-Core Solution Method for Markov Models
Despite considerable effort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very comp...
Marta Z. Kwiatkowska, Rashid Mehmood, Gethin Norma...