Sciweavers

914 search results - page 117 / 183
» Analysis of Heuristic Synergies
Sort
View
ICSM
2005
IEEE
16 years 13 days ago
Dynamic Feature Traces: Finding Features in Unfamiliar Code
This paper introduces an automated technique for feature location: helping developers map features to relevant source code. Like several other automated feature location technique...
Andrew David Eisenberg, Kris De Volder
MATES
2005
Springer
16 years 10 days ago
Reconciling Agent Ontologies for Web Service Applications
Because there is still no agreed-upon global ontology, Web services supplied by different providers typically have individual and unique semantics, described by independently devel...
Jingshan Huang, Rosa Laura Zavala Gutierrez, Benit...
FSTTCS
2004
Springer
16 years 7 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
16 years 4 days ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
ICDAR
2003
IEEE
16 years 4 days ago
A Contour Code Feature Based Segmentation For Handwriting Recognition
The purpose of this paper is to present a novel contour code feature in conjunction with a rule based segmentation for cursive handwriting recognition. A heuristic segmentation al...
Brijesh Verma