Sciweavers

562 search results - page 104 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
RSA
2008
103views more  RSA 2008»
13 years 8 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
WSNA
2003
ACM
14 years 1 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
PAMI
2010
174views more  PAMI 2010»
13 years 6 months ago
Skewed Rotation Symmetry Group Detection
—We present a novel and effective algorithm for affinely skewed rotation symmetry group detection from real-world images. We define a complete skewed rotation symmetry detectio...
Seungkyu Lee, Yanxi Liu
WCNC
2008
IEEE
14 years 2 months ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung