Sciweavers

9841 search results - page 1968 / 1969
» Distributed Value Functions
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 8 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
TVCG
2012
210views Hardware» more  TVCG 2012»
11 years 8 months ago
Scalable Multivariate Volume Visualization and Analysis Based on Dimension Projection and Parallel Coordinates
—In this paper, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel transfer function interface design that tightly c...
Hanqi Guo, He Xiao, Xiaoru Yuan
PODS
2009
ACM
124views Database» more  PODS 2009»
14 years 6 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COMPGEOM
2004
ACM
13 years 11 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
« Prev « First page 1968 / 1969 Last » Next »