Sciweavers

14548 search results - page 2477 / 2910
» The Optimal Path-Matching Problem
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
15 years 6 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
IJCV
2006
261views more  IJCV 2006»
15 years 6 months ago
Non-Rigid Stereo Factorization
In this paper we address the problem of recovering 3D non-rigid structure from a sequence of images taken with a stereo pair. We have extended existing non-rigid factorization algo...
Alessio Del Bue, Lourdes de Agapito
IJCV
2006
299views more  IJCV 2006»
15 years 6 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JACM
2006
134views more  JACM 2006»
15 years 6 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
JNW
2008
117views more  JNW 2008»
15 years 6 months ago
An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...
E. Baburaj, V. Vasudevan
« Prev « First page 2477 / 2910 Last » Next »