710 search results - page 99 / 142 » On Minimum Power Connectivity Problems |
93
Voted
ECCV
1998
Springer
16 years 2 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...
92
Voted
CORR
2007
Springer
15 years 14 days 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 × ...
123
click to vote
SERVICES
2010
14 years 7 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...
111
Voted
STOC
2009
ACM
16 years 1 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...
116
click to vote
WABI
2010
Springer
14 years 10 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...