Sciweavers

478 search results - page 36 / 96
» Context-Sensitive Dependency Pairs
Sort
View
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
14 years 10 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
IWANN
2009
Springer
15 years 6 months ago
GREAT: Gene Regulation EvAluation Tool
Our understanding of biological systems is highly dependent on the study of the mechanisms that regulate genetic expression. In this paper we present a tool to evaluate scientific ...
Catia Machado, Hugo P. Bastos, Francisco M. Couto
ICC
2008
IEEE
112views Communications» more  ICC 2008»
15 years 6 months ago
Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Javad Ghaderi, Liang-Liang Xie, Xuemin Shen
HM
2007
Springer
107views Optimization» more  HM 2007»
15 years 6 months ago
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Thomas Fischer, Peter Merz
RTA
2005
Springer
15 years 5 months ago
Orderings for Innermost Termination
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
Mirtha-Lina Fernández, Guillem Godoy, Alber...