Sciweavers

5793 search results - page 1119 / 1159
» Individual communication complexity
Sort
View
CCS
2007
ACM
14 years 1 months ago
An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism
Browsers’ isolation mechanisms are critical to users’ safety and privacy on the web. Achieving proper isolations, however, is very difficult. Historical data show that even fo...
Shuo Chen, David Ross, Yi-Min Wang
CIKM
2007
Springer
14 years 1 months ago
A dual-view approach to interactive network visualization
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 1 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
DCOSS
2007
Springer
14 years 1 months ago
Distributed Coalition Formation in Visual Sensor Networks: A Virtual Vision Approach
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
Faisal Qureshi, Demetri Terzopoulos
ECUMN
2007
Springer
14 years 1 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
« Prev « First page 1119 / 1159 Last » Next »