Sciweavers

933 search results - page 80 / 187
» A Fully Automatic hp-Adaptivity
Sort
View
CIKM
2006
Springer
15 years 6 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
BMCBI
2010
233views more  BMCBI 2010»
15 years 4 months ago
Odefy -- From discrete to continuous models
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
Jan Krumsiek, Sebastian Pölsterl, Dominik M. ...
BMCBI
2008
85views more  BMCBI 2008»
15 years 4 months ago
Normalizing biomedical terms by minimizing ambiguity and variability
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
Yoshimasa Tsuruoka, John McNaught, Sophia Ananiado...
138
Voted
ICSE
1999
IEEE-ACM
15 years 8 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
149
Voted
ICCAD
1998
IEEE
120views Hardware» more  ICCAD 1998»
15 years 8 months ago
Communication synthesis for distributed embedded systems
Designers of distributed embedded systems face many challenges in determining the appropriate tradeoffs to make when defining a system architecture or retargeting an existing desi...
Ross B. Ortega, Gaetano Borriello