Sciweavers

3875 search results - page 633 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
BMCBI
2010
106views more  BMCBI 2010»
15 years 5 months ago
Multiple structure alignment and consensus identification for proteins
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...
Ivaylo Ilinkin, Jieping Ye, Ravi Janardan
ECCV
2004
Springer
16 years 7 months ago
Multiple View Feature Descriptors from Image Sequences via Kernel Principal Component Analysis
Abstract. We present a method for learning feature descriptors using multiple images, motivated by the problems of mobile robot navigation and localization. The technique uses the ...
Jason Meltzer, Ming-Hsuan Yang, Rakesh Gupta, Stef...
ECCV
1996
Springer
16 years 7 months ago
Euclidean Reconstruction: From Paraperspective to Perspective
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
Stéphane Christy, Radu Horaud
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
16 years 6 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi