Sciweavers

3818 search results - page 707 / 764
» Word Problems on Compressed Words
Sort
View
IRI
2007
IEEE
15 years 4 months ago
Enhancing Text Analysis via Dimensionality Reduction
Many applications require analyzing vast amounts of textual data, but the size and inherent noise of such data can make processing very challenging. One approach to these issues i...
David G. Underhill, Luke McDowell, David J. Marche...
AIIA
2007
Springer
15 years 4 months ago
Towards Automated Game Design
Abstract. Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the rule system of the game and the visual real...
Mark J. Nelson, Michael Mateas
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 4 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
CIKM
2007
Springer
15 years 4 months ago
Extending query translation to cross-language query expansion with markov chain models
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
Guihong Cao, Jianfeng Gao, Jian-Yun Nie, Jing Bai
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 4 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang