4865 search results - page 706 / 973 » The Complexity of Graph Connectivity |
209
click to vote
FAST
2009
15 years 4 months ago
2009
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
291
click to vote
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
199
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
180
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
192
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...