7930 search results - page 34 / 1586 » Greedy in Approximation Algorithms |
121
click to vote
TIT
1998
15 years 2 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
126
click to vote
DCOSS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
120
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
129
Voted
IPPS
2010
IEEE
15 years 10 days ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
106
click to vote
ISCAS
2007
IEEE
15 years 8 months ago
2007
IEEE
— The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexp...