Sciweavers

10293 search results - page 264 / 2059
» Describing Semistructured Data
Sort
View
BMCBI
2006
154views more  BMCBI 2006»
15 years 6 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...
ICDM
2009
IEEE
198views Data Mining» more  ICDM 2009»
16 years 1 months ago
Information Extraction for Clinical Data Mining: A Mammography Case Study
Abstract—Breast cancer is the leading cause of cancer mortality in women between the ages of 15 and 54. During mammography screening, radiologists use a strict lexicon (BI-RADS) ...
Houssam Nassif, Ryan Woods, Elizabeth S. Burnside,...
PLDI
2005
ACM
16 years 2 days ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
ER
1995
Springer
152views Database» more  ER 1995»
15 years 10 months ago
A Logic Framework for a Semantics of Object-Oriented Data Modeling
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
Olga De Troyer, Robert Meersman
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan