Sciweavers

81 search results - page 12 / 17
» Structuring and Expanding Queries in the Probabilistic Model
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
WWW
2007
ACM
15 years 10 months ago
Topic sentiment mixture: modeling facets and opinions in weblogs
In this paper, we define the problem of topic-sentiment analysis on Weblogs and propose a novel probabilistic model to capture the mixture of topics and sentiments simultaneously....
Qiaozhu Mei, Xu Ling, Matthew Wondra, Hang Su, Che...
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 10 months ago
Access-Network Association Policies for Media Streaming in Heterogeneous Environments
Abstract--We study the design of media streaming applications in the presence of multiple heterogeneous wireless access methods with different throughputs and costs. Our objective ...
Ali ParandehGheibi, Muriel Médard, Asuman E...
JUCS
2010
135views more  JUCS 2010»
14 years 4 months ago
Internal Representation of Database Views
: Although a database view embodies partial information about the state of the main schema, the state of the view schema is a quotient (and not a subset) of the state of the main s...
Stephen J. Hegner
FCT
2005
Springer
15 years 3 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...