Sciweavers

2924 search results - page 207 / 585
» Lower Bounds in Distributed Computing
Sort
View
BIRTHDAY
2009
Springer
15 years 7 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
IANDC
2006
102views more  IANDC 2006»
15 years 3 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
JSAC
2010
92views more  JSAC 2010»
15 years 1 months ago
Analysis of Nonlinear Transition Shift and Write Precompensation in Perpendicular Recording Systems
Abstract—In high density perpendicular magnetic recording channels, nonlinear transition shift (NLTS) is one of the distortions that can degrade the system performance. Write pre...
Zheng Wu, Paul H. Siegel, Jack K. Wolf, H. Neal Be...
SPAA
1990
ACM
15 years 7 months ago
A New Preconditioner for the Parallel Solution of Positive Definite Toeplitz Systems
We introduce a new preconditioner for solving a symmetric Toeplitz system of equations by the conjugate gradient method. This choice leads to an algorithm which is particularly sui...
Dario Bini, Fabio Di Benedetto
MOBIHOC
2004
ACM
16 years 2 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...