Sciweavers

5022 search results - page 920 / 1005
» Data structures and problem solving using Java
Sort
View
JAIR
2008
103views more  JAIR 2008»
13 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
JCB
2007
146views more  JCB 2007»
13 years 9 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
PAMI
2010
222views more  PAMI 2010»
13 years 7 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
IPSN
2010
Springer
14 years 3 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
CSB
2003
IEEE
118views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Automated Protein NMR Resonance Assignments
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protei...
Xiang Wan, Dong Xu, Carolyn M. Slupsky, Guohui Lin