21324 search results - page 292 / 4265 » Making the case for computing |
115
click to vote
CHI
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we make the case for the existence and importance of a special class of email user, the highthroughput email user, whose needs are not wellserved by current clients....
148
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
122
click to vote
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
130
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
109
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is increm...