Sciweavers

276 search results - page 5 / 56
» Quantifying Homology Classes
Sort
View
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
13 years 9 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
BMCBI
2006
180views more  BMCBI 2006»
13 years 7 months ago
Building multiclass classifiers for remote homology detection and fold recognition
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
Huzefa Rangwala, George Karypis
BIOINFORMATICS
2005
140views more  BIOINFORMATICS 2005»
13 years 7 months ago
Profile-based direct kernels for remote homology detection and fold recognition
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Supervised learning algorithms based on support vector machines are ...
Huzefa Rangwala, George Karypis
COMPGEOM
2009
ACM
14 years 2 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri