Sciweavers

5606 search results - page 1056 / 1122
» Randomization Techniques for Graphs.
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
CTG: a connectivity trace generator for testing the performance of opportunistic mobile systems
The testing of the performance of opportunistic communication protocols and applications is usually done through simulation as i) deployments are expensive and should be left to t...
Roberta Calegari, Mirco Musolesi, Franco Raimondi,...
SIGSOFT
2004
ACM
15 years 10 months ago
Reasoning about partial goal satisfaction for requirements and design engineering
Exploring alternative options is at the heart of the requirements and design processes. Different alternatives contribute to different degrees of achievement of non-functional goa...
Emmanuel Letier, Axel van Lamsweerde
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
15 years 10 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
15 years 10 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
High-throughput Protein Interactome Data: Minable or Not?
There is an emerging trend in post-genome biology to study the collection of thousands of protein interaction pairs (protein interactome) derived from high-throughput experiments....
Jake Yue Chen, Andrey Y. Sivachenko, Lang Li
« Prev « First page 1056 / 1122 Last » Next »