Sciweavers

631 search results - page 116 / 127
» Why Model
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ICSE
1999
IEEE-ACM
14 years 26 days ago
Experience with Performing Architecture Tradeoff Analysis
Software architectures, like complex designs in any field, embody tradeoffs made by the designers. However, these tradeoffs are not always made explicitly by the designers and the...
Rick Kazman, Mario Barbacci, Mark Klein, S. Jeromy...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 9 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
14 years 3 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro
BMCBI
2006
85views more  BMCBI 2006»
13 years 8 months ago
Use of physiological constraints to identify quantitative design principles for gene expression in yeast adaptation to heat shoc
Background: Understanding the relationship between gene expression changes, enzyme activity shifts, and the corresponding physiological adaptive response of organisms to environme...
Ester Vilaprinyó, Rui Alves, Albert Sorriba...