Sciweavers

110 search results - page 20 / 22
» Complexity Classes as Mathematical Axioms
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 1 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 6 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
PLDI
2009
ACM
14 years 29 days ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
IPPS
2009
IEEE
14 years 24 days ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 9 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie