Sciweavers

501 search results - page 62 / 101
» An Upper Bound on the Number of Rectangulations of a Point S...
Sort
View
SIROCCO
2007
13 years 9 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...
Radha Krishna Ganti, Jeffrey G. Andrews, Martin Ha...
SIGMOD
2012
ACM
210views Database» more  SIGMOD 2012»
11 years 10 months ago
Interactive regret minimization
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, K...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
VTC
2006
IEEE
122views Communications» more  VTC 2006»
14 years 1 months ago
Analysis of Capacity Improvements in Multi-Radio Wireless Mesh Networks
In this paper, we argue that additional radios should be placed according to the distribution of traffic load in WMN. We show that the capacity of a WMN is constrained by the bottl...
Bassam Aoun, Raouf Boutaba, Gary W. Kenward