Sciweavers

994 search results - page 84 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 4 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
IJIT
2004
15 years 4 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
NAR
2011
182views Computer Vision» more  NAR 2011»
14 years 6 months ago
PAIR: the predicted Arabidopsis interactome resource
The predicted Arabidopsis interactome resource (PAIR, http://www.cls.zju.edu.cn/pair/), comprised of 5990 experimentally reported molecular interactions in Arabidopsis thaliana to...
Mingzhi Lin, Xueling Shen, Xin Chen
IPTPS
2003
Springer
15 years 8 months ago
Scooped, Again
The Peer-to-Peer (p2p) and Grid infrastructure communities are tackling an overlapping set of problems. In addressing these problems, p2p solutions are usually motivated by elegan...
Jonathan Ledlie, Jeffrey Shneidman, Margo I. Seltz...