Sciweavers

244 search results - page 48 / 49
» Compressive PCA on Graphs
Sort
View
INFOCOM
2005
IEEE
13 years 11 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
STACS
2005
Springer
13 years 11 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
13 years 11 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
NOSSDAV
2001
Springer
13 years 10 months ago
Network support for mobile multimedia using a self-adaptive distributed proxy
Recent advancements in video and audio codec technologies (e.g., RealVideo [18]) make multimedia streaming possible across a wide range of network conditions. With an increasing t...
Zhuoqing Morley Mao, Hoi-sheung Wilson So, Byungho...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek