Sciweavers

550 search results - page 108 / 110
» Supporting plan authoring and analysis
Sort
View
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 6 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
CSCW
2008
ACM
13 years 6 months ago
Context-linked virtual assistants for distributed teams: an astrophysics case study
There is a growing need for distributed teams to analyze complex and dynamic data streams and make critical decisions under time pressure. Via a case study, we discuss potential g...
Sarah S. Poon, Rollin C. Thomas, Cecilia R. Aragon...
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 6 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
CN
2007
117views more  CN 2007»
13 years 6 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
CCR
2004
86views more  CCR 2004»
13 years 5 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...