Sciweavers

3680 search results - page 614 / 736
» cases 2010
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 4 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
BMCBI
2010
128views more  BMCBI 2010»
15 years 4 months ago
Conserved residue clusters at protein-protein interfaces and their use in binding site identification
Background: Biological evolution conserves protein residues that are important for structure and function. Both protein stability and function often require a certain degree of st...
Mainak Guharoy, Pinak Chakrabarti
PODC
2010
ACM
15 years 8 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 6 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
15 years 6 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...