2254 search results - page 103 / 451 » Computing the minimal covering set |
117
Voted
MOBIHOC
2002
ACM
16 years 10 days ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
99
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional clas...
96
Voted
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
WINE
2009
Springer
15 years 7 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
103
Voted
CAV
1993
Springer
15 years 4 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...