Sciweavers

814 search results - page 141 / 163
» Optimal pairings
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 4 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
JSAC
2008
161views more  JSAC 2008»
13 years 9 months ago
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
Abstract--Radio spectrum resource is of fundamental importance for wireless communication. Recent reports show that most available spectrum has been allocated. While some of the sp...
Juncheng Jia, Qian Zhang, Xuemin Shen
ESWS
2009
Springer
14 years 4 months ago
Improving Ontology Matching Using Meta-level Learning
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...
Kai Eckert, Christian Meilicke, Heiner Stuckenschm...
CVPR
2006
IEEE
14 years 12 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 10 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...