Sciweavers

361 search results - page 51 / 73
» Maximum subset intersection
Sort
View
WISE
2007
Springer
14 years 3 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
PODC
2006
ACM
14 years 3 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
SMI
2005
IEEE
14 years 3 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
ATVA
2005
Springer
202views Hardware» more  ATVA 2005»
14 years 3 months ago
Model Checking Real Time Java Using Java PathFinder
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Gary Lindstrom, Peter C. Mehlitz, Willem Visser
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun