Sciweavers

441 search results - page 15 / 89
» Optimal Subsequence Bijection
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
15 years 4 months ago
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
Sivaram Gopalakrishnan, Priyank Kalla
VLDB
2005
ACM
85views Database» more  VLDB 2005»
15 years 3 months ago
Inspector Joins
The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this kno...
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...
ICRA
1998
IEEE
128views Robotics» more  ICRA 1998»
15 years 1 months ago
Hybrid, High-Precision Localisation for the Mail Distributing Mobile Robot System MOPS
This paper describes the new localisation algorithms under implementation for the mail distributing mobile robot, MOPS, of the Institute of Robotics, Swiss Federal Institute of Te...
Kai Oliver Arras, Sjur J. Vestli
ECML
2006
Springer
14 years 11 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev