Sciweavers

608 search results - page 34 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
14 years 16 days ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 9 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 9 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
INFOCOM
2007
IEEE
14 years 3 months ago
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
Changhee Joo, Ness B. Shroff
INFOCOM
2007
IEEE
14 years 3 months ago
Bandwidth Balancing in Multi-Channel IEEE 802.16 Wireless Mesh Networks
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
Claudio Cicconetti, Ian F. Akyildiz, Luciano Lenzi...