900 search results - page 78 / 180 » On Polynomial Time Computation over Unordered Structures |
115
click to vote
GI
2004
Springer
15 years 8 months ago
2004
Springer
: 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 ...
133
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
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...
148
click to vote
PODS
2001
ACM
16 years 3 months ago
2001
ACM
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...
103
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
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...
127
Voted
CHI
2010
ACM
15 years 10 months ago
2010
ACM
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 ...