358 search results - page 49 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
118
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
139
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
137
click to vote
MM
2010
ACM
15 years 2 months ago
2010
ACM
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
127
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
118
click to vote
MDM
2007
Springer
15 years 8 months ago
2007
Springer
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...