Sciweavers

70 search results - page 1 / 14
» Binary (generalized) Post Correspondence Problem
Sort
View
TCS
2002
13 years 3 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
CG
2002
Springer
13 years 3 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein
WSDM
2012
ACM
300views Data Mining» more  WSDM 2012»
11 years 11 months ago
Adding semantics to microblog posts
Microblogs have become an important source of information for the purpose of marketing, intelligence, and reputation management. Streams of microblogs are of great value because o...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
SAT
2004
Springer
101views Hardware» more  SAT 2004»
13 years 9 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...