Sciweavers

3818 search results - page 110 / 764
» Word Problems on Compressed Words
Sort
View
ICWSM
2009
15 years 2 months ago
Delta TFIDF: An Improved Feature Space for Sentiment Analysis
Mining opinions and sentiment from social networking sites is a popular application for social media systems. Common approaches use a machine learning system with a bag of words f...
Justin Martineau, Tim Finin
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 11 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
130
Voted
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 4 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
FOCS
2002
IEEE
15 years 9 months ago
Quantum Computation and Lattice Problems
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
Oded Regev
133
Voted
SAC
1997
ACM
15 years 8 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn