Sciweavers

1055 search results - page 31 / 211
» Enumerations in computable structure theory
Sort
View
DCC
2011
IEEE
13 years 5 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 10 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
TON
2010
141views more  TON 2010»
13 years 8 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
SEMCO
2007
IEEE
14 years 4 months ago
Automatic Generation of Multi-Modal Dialogue from Text Based on Discourse Structure Analysis
In this paper, we propose a novel method for generating engaging multi-modal content automatically from text. Rhetorical Structure Theory (RST) is used to decompose text into disc...
Helmut Prendinger, Paul Piwek, Mitsuru Ishizuka
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 10 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters