Sciweavers

1220 search results - page 195 / 244
» Minimal Interval Completions
Sort
View
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
ATAL
2010
Springer
13 years 8 months ago
Augmenting appearance-based localization and navigation using belief update
Appearance-based localization compares the current image taken from a robot's camera to a set of pre-recorded images in order to estimate the current location of the robot. S...
George Chrysanthakopoulos, Guy Shani
CAISE
2010
Springer
13 years 8 months ago
Beyond Process Mining: From the Past to Present and Future
Abstract. Traditionally, process mining has been used to extract models from event logs and to check or extend existing models. This has shown to be useful for improving processes ...
Wil M. P. van der Aalst, Maja Pesic, Minseok Song
CCGRID
2010
IEEE
13 years 8 months ago
A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
Javier Celaya, Loris Marchal
ICML
2010
IEEE
13 years 8 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...