Sciweavers

2969 search results - page 494 / 594
» A space efficient algorithm for group structure computation
Sort
View
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
RECOMB
2004
Springer
16 years 6 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
CVPR
2007
IEEE
16 years 8 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
BMCBI
2005
161views more  BMCBI 2005»
15 years 6 months ago
Non-linear mapping for exploratory data analysis in functional genomics
Background: Several supervised and unsupervised learning tools are available to classify functional genomics data. However, relatively less attention has been given to exploratory...
Francisco Azuaje, Haiying Wang, Alban Chesneau
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 6 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia