Sciweavers

3604 search results - page 495 / 721
» All Common Subsequences
Sort
View
ANOR
2007
92views more  ANOR 2007»
15 years 6 months ago
Portfolio selection with probabilistic utility
We present a novel portfolio selection technique, which replaces the traditional maximization of the utility function with a probabilistic approach inspired by statistical physics....
Robert Marschinski, Pietro Rossi, Massimo Tavoni, ...
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
15 years 6 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
BIOSYSTEMS
2008
100views more  BIOSYSTEMS 2008»
15 years 6 months ago
Objective patterns in the evolving network of non-equivalent observers
The world's objective pattern is formed through consistent histories of quantum measurements originating as different branches of the same wave function. When we come close t...
Abir U. Igamberdiev
CGF
2010
111views more  CGF 2010»
15 years 6 months ago
One Point Isometric Matching with the Heat Kernel
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
Maks Ovsjanikov, Quentin Mérigot, Facundo M...
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 6 months ago
Asynchronous Bounded Expected Delay Networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...