1405 search results - page 77 / 281 » Popularity at Minimum Cost |
108
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
146
click to vote
FGCN
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. FSO mesh networks are emerging as broadband communication networks because of ...
127
click to vote
ISSS
2002
IEEE
15 years 9 months ago
2002
IEEE
Scheduling is widely recognized as a very important step in highlevel synthesis. Nevertheless, it is usually done without taking into account the effects on the actual hardware im...
126
click to vote
TIT
1998
15 years 3 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
133
click to vote
EOR
2010
15 years 1 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...