Sciweavers

2229 search results - page 271 / 446
» Comparative analysis of biclustering algorithms
Sort
View
JCB
2008
144views more  JCB 2008»
13 years 10 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
PAMI
2008
182views more  PAMI 2008»
13 years 10 months ago
Gaussian Process Dynamical Models for Human Motion
We introduce Gaussian process dynamical models (GPDMs) for nonlinear time series analysis, with applications to learning models of human pose and motion from high-dimensional motio...
Jack M. Wang, David J. Fleet, Aaron Hertzmann
TCS
2008
13 years 10 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
TPDS
2008
76views more  TPDS 2008»
13 years 10 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
DATAMINE
2002
83views more  DATAMINE 2002»
13 years 10 months ago
Automated Remote Sensing with Near Infrared Reflectance Spectra: Carbonate Recognition
Reflectance spectroscopy is a standard tool for studying the mineral composition of rock and soil samples and for remote sensing of terrestrial and extraterrestrial surfaces. We de...
Joseph Ramsey, Paul Gazis, Ted Roush, Peter Spirte...