5115 search results - page 559 / 1023 » On Randomized Lanczos Algorithms |
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
208
click to vote
ICDCS
2006
IEEE
16 years 24 days ago
2006
IEEE
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
184
click to vote
BROADNETS
2005
IEEE
16 years 12 days ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
148
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
189
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...