2314 search results - page 160 / 463 » Minimal Partitions of a Graph |
155
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
98
Voted
ISLPED
2003
ACM
15 years 9 months ago
2003
ACM
Multivoltage scheduling (MVS) for datapaths offers the energy savings of voltage scaling on a per-operation basis with a voltage aware operator scheduling. This work investigates...
138
Voted
EMNLP
2006
15 years 5 months ago
2006
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
144
click to vote
DAM
2010
15 years 4 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
116
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...