Sciweavers

1053 search results - page 173 / 211
» Shape as Memory Storage
Sort
View
139
Voted
ISMB
1993
15 years 5 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
143
Voted
HPDC
2010
IEEE
15 years 4 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...
146
Voted
AINA
2010
IEEE
15 years 4 months ago
Schedule Distributed Virtual Machines in a Service Oriented Environment
—Virtual machines offer unique advantages to the scientific computing community, such as Quality of Service(QoS) guarantee, performance isolation, easy resource management, and ...
Lizhe Wang, Gregor von Laszewski, Marcel Kunze, Ji...
129
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
116
Voted
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
15 years 4 months ago
Adaptive indexing for relational keys
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
Goetz Graefe, Harumi A. Kuno