Sciweavers

2004 search results - page 218 / 401
» Sampling from large graphs
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 8 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
BMCBI
2010
82views more  BMCBI 2010»
15 years 3 months ago
Predicting the network of substrate-enzyme-product triads by combining compound similarity and functional domain composition
Background: Metabolic pathway is a highly regulated network consisting of many metabolic reactions involving substrates, enzymes, and products, where substrates can be transformed...
Lei Chen, Kai-Yan Feng, Yu-Dong Cai, Kuo-Chen Chou...
CVPR
2005
IEEE
16 years 5 months ago
Learning a Similarity Metric Discriminatively, with Application to Face Verification
We present a method for training a similarity metric from data. The method can be used for recognition or verification applications where the number of categories is very large an...
Sumit Chopra, Raia Hadsell, Yann LeCun
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
16 years 5 months ago
COLR-Tree: Communication-Efficient Spatio-Temporal Indexing for a Sensor Data Web Portal
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
Yanif Ahmad, Suman Nath
MVA
2002
119views Computer Vision» more  MVA 2002»
15 years 3 months ago
A Cooperative Method of SFM and Stereo for Motion and Depth Extraction
Stereo is a useful technique for obtaining depth information from images. However, it is required that the baseline length between two cameras should be large to increase depth pr...
Jae-Hean Kim, Myung Jin Chung