986 search results - page 141 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
148
Voted
INFOCOM
1998
IEEE
15 years 7 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
223
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
162
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
128
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
138
Voted
TIT
2008
15 years 3 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...