Sciweavers

3228 search results - page 480 / 646
» Basics of Compiler Design
Sort
View
ICSM
2009
IEEE
16 years 6 days ago
A statistical examination of the evolution and properties of libre software
How and why does software evolve? This question has been under study since almost 40 years ago, and it is still a subject of controversy. In the seventies, Meir M. Lehman formulat...
Israel Herraiz
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
16 years 5 days ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
FSTTCS
2009
Springer
16 years 4 days ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
LION
2009
Springer
115views Optimization» more  LION 2009»
16 years 3 days ago
Flexible Stochastic Local Search for Haplotype Inference
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Luca Di Gaspero, Andrea Roli
MM
2009
ACM
125views Multimedia» more  MM 2009»
16 years 2 days ago
Unfolding speaker clustering potential: a biomimetic approach
Speaker clustering is the task of grouping a set of speech utterances into speaker-specific classes. The basic techniques for solving this task are similar to those used for spea...
Thilo Stadelmann, Bernd Freisleben