6740 search results - page 1126 / 1348 » An s -Hamiltonian Line Graph Problem |
163
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
222
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
157
Voted
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—Immediate notification of urgent but rare events and delivery of time sensitive actuation commands appear in many practical wireless sensor and actuator network applications. M...
114
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
116
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...