Sciweavers

4843 search results - page 426 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
INFOCOM
2006
IEEE
15 years 11 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 9 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
CORR
2012
Springer
218views Education» more  CORR 2012»
14 years 18 days ago
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
Shahar Dobzinski, Jan Vondrák
92
Voted
ICIP
1998
IEEE
16 years 6 months ago
Edge Detection Error in the Discrete Laplacian of Gaussian
This paper addresses the problem of determining suitable mask values and sizes for the discrete implementation of the Laplacian of Gaussian edge operator. This is achieved by prov...
Steve R. Gunn