Sciweavers

3049 search results - page 259 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
WWW
2005
ACM
16 years 7 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
INFOCOM
2010
IEEE
15 years 5 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 6 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
ICASSP
2011
IEEE
14 years 10 months ago
Interference alignment in MIMO cellular networks
We explore the feasibility of linear interference alignment (IA) in MIMO cellular networks. Each base station (BTS) has Nt transmit antennas, each mobile has Nr receive antennas, ...
Binnan Zhuang, Randall A. Berry, Michael L. Honig
ENDM
2010
105views more  ENDM 2010»
15 years 6 months ago
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbe...