Sciweavers

2695 search results - page 91 / 539
» Learning Graph Matching
Sort
View
133
Voted
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
15 years 7 months ago
Learning dynamic temporal graphs for oil-production equipment monitoring system
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
135
Voted
CVPR
2007
IEEE
16 years 4 months ago
Topology matching for 3D video compression
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
Tony Tung, Francis Schmitt, Takashi Matsuyama
ICML
2010
IEEE
15 years 3 months ago
Large Graph Construction for Scalable Semi-Supervised Learning
In this paper, we address the scalability issue plaguing graph-based semi-supervised learning via a small number of anchor points which adequately cover the entire point cloud. Cr...
Wei Liu, Junfeng He, Shih-Fu Chang
APPML
2011
14 years 9 months ago
Bounds on the k-domination number of a graph
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
Ermelinda DeLaViña, Wayne Goddard, Michael ...