Sciweavers

1068 search results - page 75 / 214
» On Space Bounded Server Algorithms
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Noise power gain as a measure of errors in discrete-time transversal estimators
The noise power gain (NPG) is addressed and the error bound (EB) is specified via NPG for a general p-shift linear timevariant finite impulse response (FIR) transversal estimato...
Yuriy S. Shmaliy, Oscar Gerardo Ibarra-Manzano
COR
2007
87views more  COR 2007»
13 years 7 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
OPODIS
2008
13 years 9 months ago
On the Time-Complexity of Robust and Amnesic Storage
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
Dan Dobre, Matthias Majuntke, Neeraj Suri
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
13 years 9 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
MOBIHOC
2004
ACM
14 years 7 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...