Sciweavers

5981 search results - page 254 / 1197
» time 2006
Sort
View
QUESTA
2002
86views more  QUESTA 2002»
15 years 6 months ago
Optimality of D-Policies for an M/G/1 Queue with a Removable Server
We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding ...
Eugene A. Feinberg, Offer Kella
IJCGA
2010
99views more  IJCGA 2010»
15 years 5 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
IPL
2010
94views more  IPL 2010»
15 years 5 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
JOT
2010
167views more  JOT 2010»
15 years 5 months ago
The Discrete Fourier Transform, Part 5: Spectrogram
This paper is part 5 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on the spectrog...
Douglas Lyon
JOT
2010
186views more  JOT 2010»
15 years 5 months ago
The Discrete Fourier Transform, Part 6: Cross-Correlation
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
Douglas Lyon