Sciweavers

2485 search results - page 102 / 497
» Time Bounded Frequency Computations
Sort
View
MFCS
2010
Springer
15 years 3 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
Bernd Puchala, Roman Rabinovich
DAC
2000
ACM
15 years 9 months ago
TACO: timing analysis with coupling
: The impact of coupling capacitance on delay is usually estimated by scaling the coupling capacitances (often by a factor of 2) and modeling them as grounded. This simple approach...
Ravishankar Arunachalam, Karthik Rajagopal, Lawren...
FOCS
2008
IEEE
15 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
TON
1998
87views more  TON 1998»
15 years 4 months ago
Adaptive hybrid clock discipline algorithm for the network time protocol
This paper describes the analysis, implementation and performance of a new algorithm engineered to discipline a computer clock to a source of standard time, such as a GPS receiver...
David L. Mills
VTC
2006
IEEE
125views Communications» more  VTC 2006»
15 years 10 months ago
A Carrier Interferometry based Channel Estimation Technique for One-Cell Reuse MIMO-OFDM/TDMA Cellular Systems
Abstract— This paper propose a channel estimation technique for multiple-input multiple-output (MIMO) - orthogonal frequency division multiplexing (OFDM) / time division multiple...
Kazunari Yokomakura, Seiichi Sampei, Hiroshi Harad...