463 search results - page 38 / 93 » The Most Reliable Subgraph Problem |
103
Voted
BMVC
2010
14 years 12 months ago
2010
Texture classification is used for many vision systems; in this paper we focus on improving the reliability of the classification through the so-called imprecise (or credal) class...
137
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
117
Voted
EUROSYS
2008
ACM
15 years 11 months ago
2008
ACM
Hard disks contain data—frequently an irreplaceable asset of high monetary and non-monetary value. At the same time, hard disks are mechanical devices that consume power, are no...
101
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
101
Voted
ICNSC
2008
IEEE
15 years 8 months ago
2008
IEEE
Today's communication-based applications are mostly crafted in a stovepipe development paradigm, which is inflexible to be used by various domain-specific applications and cos...