779 search results - page 116 / 156 » Algorithms for the Sample Mean of Graphs |
139
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Microarrays have become extremely useful for analysing genetic phenomena, but establishing a relation between microarray analysis results (typically a list of genes) a...
139
click to vote
CGO
2008
IEEE
15 years 11 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
132
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
171
click to vote
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
145
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Landmark-based graphs are a useful and parsimonious tool for representing large scale environments. Relating landmarks by means of feedback-control algorithms encoded i...