Sciweavers

999 search results - page 39 / 200
» Spectral simplex method
Sort
View
108
Voted
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 3 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
AMC
2007
108views more  AMC 2007»
15 years 2 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
146
Voted
WABI
2005
Springer
179views Bioinformatics» more  WABI 2005»
15 years 7 months ago
Spectral Clustering Gene Ontology Terms to Group Genes by Function
Abstract. With the invention of biotechnological high throughput methods like DNA microarrays, biologists are capable of producing huge amounts of data. During the analysis of such...
Nora Speer, Christian Spieth, Andreas Zell
IJBRA
2008
69views more  IJBRA 2008»
15 years 2 months ago
A matrix-based multilevel approach to identify functional protein modules
: Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [2...
Suely Oliveira, Sang-Cheol Seok
101
Voted
ICRA
2010
IEEE
138views Robotics» more  ICRA 2010»
15 years 26 days ago
Maximum likelihood mapping with spectral image registration
Abstract— A core challenge in probabilistic mapping is to extract meaningful uncertainty information from data registration methods. While this has been investigated in ICP-based...
Max Pfingsthorn, Andreas Birk 0002, Sören Sch...