710 search results - page 99 / 142 » On Minimum Power Connectivity Problems |
ECCV
1998
Springer
14 years 12 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
CORR
2007
Springer
13 years 10 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 × ...
SERVICES
2010
13 years 4 months ago
2010
Abstract--Mobile devices such as smart phones are increasing permeating society. With strides in computational power, coupled with the ability to connect to other small devices, sm...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
WABI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...