Sciweavers

4850 search results - page 898 / 970
» Approximate Data Structures with Applications
Sort
View
ISMB
2000
14 years 11 months ago
Towards a Systematics for Protein Subcellular Location: Quantitative Description of Protein Localization Patterns and Automated
Determination of the functions of all expressed proteins represents one of the major upcoming challenges in computational molecular biology. Since subcellular location plays a cru...
Robert F. Murphy, Michael V. Boland, Meel Velliste
IFIPPACT
1994
14 years 11 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
14 years 11 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
ERCIMDL
2010
Springer
168views Education» more  ERCIMDL 2010»
14 years 11 months ago
The Planets Testbed - A Collaborative Research Environment for Digital Preservation
The Planets Testbed is an open access web application for the digital preservation community, providing an experimental framework for evaluating preservation tools and approaches i...
Brian Aitken, Seamus Ross, Andrew Lindley, Edith M...
CCS
2010
ACM
14 years 10 months ago
A privacy recommendation wizard for users of social networking sites
Privacy is a huge problem for users of social networking sites. While sites like Facebook allow individual users to personalize fine-grained privacy settings, this has proven quit...
Lujun Fang, Heedo Kim, Kristen LeFevre, Aaron Tami