Sciweavers

40 search results - page 7 / 8
» Constructing t-designs from t-wise balanced designs
Sort
View
CLEF
2007
Springer
13 years 12 months ago
ParaMor: Finding Paradigms across Morphology
Our algorithm, ParaMor, fared well in Morpho Challenge 2007 (Kurimo et al., 2007), a peer operated competition pitting against one another algorithms designed to discover the morp...
Christian Monson, Jaime G. Carbonell, Alon Lavie, ...
PPOPP
2003
ACM
13 years 11 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
EUMAS
2006
13 years 7 months ago
A Customizable Multi-Agent System for Distributed Data Mining
We present a general Multi-Agent System framework for distributed data mining based on a Peer-toPeer model. The framework adopts message-based asynchronous communication and a dyn...
Giancarlo Fortino, Giuseppe Di Fatta
BMCBI
2008
117views more  BMCBI 2008»
13 years 5 months ago
Using a logical model to predict the growth of yeast
Background: A logical model of the known metabolic processes in S. cerevisiae was constructed from iFF708, an existing Flux Balance Analysis (FBA) model, and augmented with inform...
Ken E. Whelan, Ross D. King
INFOCOM
2007
IEEE
14 years 2 days ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...