Sciweavers

4745 search results - page 266 / 949
» Discretization: An Enabling Technique
Sort
View
163
Voted
EWSN
2008
Springer
16 years 6 months ago
Tracking Dynamic Boundary Fronts Using Range Sensors
Abstract. We examine the problem of tracking dynamic boundaries occurring in natural phenomena using range sensors. Two main challenges of the boundary tracking problem are energy-...
Subhasri Duttagupta, Krithi Ramamritham, Purushott...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
16 years 4 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
190
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 4 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
ICCAD
2001
IEEE
127views Hardware» more  ICCAD 2001»
16 years 3 months ago
What is the Limit of Energy Saving by Dynamic Voltage Scaling?
Dynamic voltage scaling (DVS) is a technique that varies the supply voltage and clock frequency based on the computation load to provide desired performance with the minimal amoun...
Gang Qu
CVPR
2010
IEEE
16 years 2 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler