461 search results - page 67 / 93 » Practical polynomial factoring in polynomial time |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
QSHINE
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
WAOA
2005
Springer
14 years 27 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...