Sciweavers

933 search results - page 103 / 187
» Monotone Complexity of a Pair
Sort
View
MICCAI
2007
Springer
14 years 10 months ago
Object Localization Based on Markov Random Fields and Symmetry Interest Points
We present an approach to detect anatomical structures by configurations of interest points, from a single example image. The representation of the configuration is based on Markov...
Branislav Micusík, Georg Langs, Horst Bisch...
ICML
2001
IEEE
14 years 9 months ago
Round Robin Rule Learning
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...
Johannes Fürnkranz
WWW
2007
ACM
14 years 9 months ago
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
14 years 3 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
ICC
2009
IEEE
161views Communications» more  ICC 2009»
14 years 3 months ago
Downlink OFDMA Resource Allocation Under Partial Channel State Information
Abstract— The problem of resource allocation (RA) in a downlink OFDMA system is examined under the realistic assumption of imperfect channel state information (CSI) at the base s...
Stelios Stefanatos, Nikos Dimitriou