Sciweavers

10457 search results - page 1595 / 2092
» Data Mapping as Search
Sort
View
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 7 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
COMSUR
2008
169views more  COMSUR 2008»
15 years 7 months ago
Peer-to-peer-based resource discovery In global grids: A tutorial
Efficient Resource discovery mechanism is one of the fundamental requirement for Grid computing systems, as it aids in resource management and scheduling of applications. Resource...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
BMCBI
2006
95views more  BMCBI 2006»
15 years 7 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
BMCBI
2006
105views more  BMCBI 2006»
15 years 7 months ago
CRNPRED: highly accurate prediction of one-dimensional protein structures by large-scale critical random networks
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
Akira R. Kinjo, Ken Nishikawa
IANDC
2008
92views more  IANDC 2008»
15 years 7 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
« Prev « First page 1595 / 2092 Last » Next »