7930 search results - page 154 / 1586 » Greedy in Approximation Algorithms |
168
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
208
click to vote
IPCO
2001
15 years 7 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
169
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
152
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
164
click to vote
ICC
2008
IEEE
16 years 25 days ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...