Sciweavers

392 search results - page 9 / 79
» Reversal Complexity Revisited
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
14 years 27 days ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
ACMSE
2006
ACM
13 years 11 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
INTEGRATION
2008
89views more  INTEGRATION 2008»
13 years 7 months ago
Exact ESCT minimization for functions of up to six input variables
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
ICFCA
2005
Springer
14 years 1 months ago
Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering
A key difficulty in the maintenance and evolution of complex software systems is to recognize and understand the implicit dependencies that define contracts that must be respecte...
Gabriela Arévalo, Stéphane Ducasse, ...