Sciweavers

982 search results - page 137 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
14 years 10 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
ICIP
2003
IEEE
16 years 2 months ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 4 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
CVPR
2004
IEEE
16 years 2 months ago
Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
15 years 9 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou