Sciweavers

2214 search results - page 288 / 443
» complexity 2004
Sort
View
COMPGEOM
2004
ACM
15 years 10 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
CSCW
2004
ACM
15 years 10 months ago
Return on investment and organizational adoption
This paper considers the complexity of measuring the return on investment for technology adoption. A brief case study of technology adoption in a large design and construction fir...
Jonathan Grudin
CSCW
2004
ACM
15 years 10 months ago
Group awareness in distributed software development
Open-source software development projects are almost always collaborative and distributed. Despite the difficulties imposed by distance, these projects have managed to produce lar...
Carl Gutwin, Reagan Penner, Kevin A. Schneider
CSCW
2004
ACM
15 years 10 months ago
The multiple views of inter-organizational authoring
Collaborative authoring is a common workplace task. Yet, despite improvements in word processors, communication software, and file sharing, many problems continue to plague co-aut...
David W. McDonald, Chunhua Weng, John H. Gennari
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
15 years 10 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer