Sciweavers

684 search results - page 109 / 137
» A characterization of b-perfect graphs
Sort
View
PODS
2001
ACM
135views Database» more  PODS 2001»
15 years 12 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
INFOCOM
2009
IEEE
15 years 6 months ago
Understanding the Performance Gap Between Pull-Based Mesh Streaming Protocols and Fundamental Limits
—Pull-based mesh streaming protocols have recently received much research attention, with successful commercial systems showing their viability in the Internet. Despite the remar...
Chen Feng, Baochun Li, Bo Li
96
Voted
IPPS
2009
IEEE
15 years 6 months ago
Toward adjoinable MPI
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
SEMWEB
2009
Springer
15 years 6 months ago
Context and Domain Knowledge Enhanced Entity Spotting in Informal Text
This paper explores the application of restricted relationship graphs (RDF) and statistical NLP techniques to improve named entity annotation in challenging Informal English domain...
Daniel Gruhl, Meenakshi Nagarajan, Jan Pieper, Chr...
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
15 years 6 months ago
On frame and orientation localization for relative sensing networks
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
Giulia Piova, Iman Shames, Baris Fidan, Francesco ...