Sciweavers

943 search results - page 34 / 189
» How should data structures and algorithms be taught
Sort
View
BMCBI
2008
117views more  BMCBI 2008»
14 years 9 months ago
RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
Background: With the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is neede...
Qi Liu, Yu Yang, Chun Chen, Jiajun Bu, Yin Zhang, ...
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 2 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
INFOCOM
2011
IEEE
14 years 1 months ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 1 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ISAAC
2004
Springer
84views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Property-Preserving Data Reconstruction
We initiate a new line of investigation into online property-preserving data reconstruction. Consider a dataset which is assumed to satisfy various (known) structural properties; e...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...