Sciweavers

900 search results - page 78 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
GI
2004
Springer
14 years 2 months ago
Contractual Relationships in Open Source Structures
: The article provides an overview of the legal relationships in Open Source Structures. It shows that – as within all software development and distribution models – different ...
Carsten Schulz
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 18 days ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 9 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...
STACS
2010
Springer
14 years 3 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
CHI
2010
ACM
14 years 3 months ago
Real time search user behavior
Real time search is an increasingly important area of information seeking on the Web. In this research, we analyze 1,005,296 user interactions with a real time search engine over ...
Bernard J. Jansen, Gerry Campbell, Matthew Gregg