Sciweavers

4911 search results - page 168 / 983
» Tree dependence analysis
Sort
View
CASES
2006
ACM
15 years 9 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
INFOCOM
2003
IEEE
15 years 8 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
IIS
2003
15 years 4 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
ALMOB
2008
131views more  ALMOB 2008»
15 years 3 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ICST
2011
IEEE
14 years 6 months ago
An Empirical Study on the Relation between Dependency Neighborhoods and Failures
—Changing source code in large software systems is complex and requires a good understanding of dependencies between software components. Modification to components with little ...
Thomas Zimmermann, Nachiappan Nagappan, Kim Herzig...