Sciweavers

50 search results - page 5 / 10
» Universal Succinct Representations of Trees
Sort
View
CACM
2006
95views more  CACM 2006»
13 years 7 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
TSD
2005
Springer
14 years 1 months ago
Experimental Evaluation of Tree-Based Algorithms for Intonational Breaks Representation
Abstract. The prosodic specification of an utterance to be spoken by a Textto-Speech synthesis system can be devised in break indices, pitch accents and boundary tones. In particu...
Panagiotis Zervas, Gerasimos Xydas, Nikos Fakotaki...
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
14 years 23 days ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
14 years 1 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
PPOPP
2012
ACM
12 years 3 months ago
PARRAY: a unifying array representation for heterogeneous parallelism
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU c...
Yifeng Chen, Xiang Cui, Hong Mei