Sciweavers

32 search results - page 6 / 7
» Interval completion with few edges
Sort
View
ICIP
2010
IEEE
13 years 5 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 7 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
WABI
2007
Springer
102views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Homology Search with Fragmented Nucleic Acid Sequence Patterns
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
Axel Mosig, Julian J.-L. Chen, Peter F. Stadler
BMCBI
2007
219views more  BMCBI 2007»
13 years 7 months ago
MetaQTL: a package of new computational methods for the meta-analysis of QTL mapping experiments
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
Jean-Baptiste Veyrieras, Bruno Goffinet, Alain Cha...

Publication
267views
14 years 4 months ago
Interactive planar reconstruction of objects and scenes
3D reconstruction from 2D images is an active research topic in the computer vision community. Classical algorithms like Structure From Motion (SFM) and Multi-View Stereo (MVS) are...
Adarsh Kowdle, Yao-Jen Chang, Tsuhan Chen