Sciweavers

2434 search results - page 90 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
157
Voted
RECOMB
2004
Springer
16 years 3 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...
89
Voted
JSYML
2011
87views more  JSYML 2011»
14 years 10 months ago
Benign cost functions and lowness properties
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
Noam Greenberg, André Nies
125
Voted
PSIVT
2007
Springer
110views Multimedia» more  PSIVT 2007»
15 years 9 months ago
Measuring Linearity of Ordered Point Sets
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
Milos Stojmenovic, Amiya Nayak
125
Voted
CIBCB
2006
IEEE
15 years 7 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...
150
Voted
ECCV
2006
Springer
16 years 5 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...