Sciweavers

1439 search results - page 282 / 288
» Fast approximation of centrality
Sort
View
SBBD
2008
256views Database» more  SBBD 2008»
13 years 11 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
VMV
2008
307views Visualization» more  VMV 2008»
13 years 11 months ago
2D Video Editing for 3D Effects
We present a semi-interactive system for advanced video processing and editing. The basic idea is to partially recover planar regions in object space and to exploit this minimal p...
Darko Pavic, Volker Schönefeld, Lars Krecklau...
NIPS
2004
13 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
ALMOB
2008
95views more  ALMOB 2008»
13 years 10 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
BMCBI
2010
175views more  BMCBI 2010»
13 years 10 months ago
Calibur: a tool for clustering large numbers of protein decoys
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
Shuai Cheng Li, Yen Kaow Ng