Sciweavers

288 search results - page 37 / 58
» On the number of maximal independent sets in a graph
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
15 years 3 months ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga
PAMI
2007
122views more  PAMI 2007»
14 years 9 months ago
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Anupama Jagannathan, Eric L. Miller
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
15 years 4 months ago
A structured multiarmed bandit problem and the greedy policy
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
Adam J. Mersereau, Paat Rusmevichientong, John N. ...
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
15 years 4 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...