Sciweavers

11213 search results - page 235 / 2243
» Low-contention data structures
Sort
View
ICCS
2007
Springer
15 years 9 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley
ASUNAM
2011
IEEE
14 years 5 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
15 years 9 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
152
Voted
NAR
2008
90views more  NAR 2008»
15 years 5 months ago
Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata
Many Microbe Microarrays Database (M3D ) is designed to facilitate the analysis and visualization of expression data in compendia compiled from multiple laboratories. M3D contains...
Jeremiah J. Faith, Michael E. Driscoll, Vincent A....
JACM
2000
131views more  JACM 2000»
15 years 5 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle