2137 search results - page 201 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
148
click to vote
ACL
1998
15 years 7 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
157
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
178
Voted
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
145
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
166
click to vote
MICCAI
2005
Springer
16 years 7 months ago
2005
Springer
Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of vari...