588 search results - page 37 / 118 » Reducibility and Completeness in Private Computations |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
SAC
2006
ACM
13 years 10 months ago
2006
ACM
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
VTC
2008
IEEE
14 years 4 months ago
2008
IEEE
—Orthogonal frequency division multiplexing (OFDM) signals have a problem with high peak-to-average power ratio (PAPR). A distortionless selective mapping (SLM) has been proposed...
PODC
1999
ACM
14 years 2 months ago
1999
ACM
The dynamically configurable distributed object (DCDO) model helps enable object evolution and facilitate the development of distributed objects from multiple independent implemen...