Sciweavers

1686 search results - page 51 / 338
» Programs as polygraphs: computability and complexity
Sort
View
85
Voted
CSO
2009
IEEE
15 years 4 months ago
A Special Prosodic Phrasing in Broadcasting News Programs
In order to improve and convey the semantic information perfectly and vividly through synthesized speech, a special prosodic phrasing in broadcasting news programs, namely complex...
Yu Zou, Wei He, Yuqiang Zhang, Min Hou, Weibin Zhu
DCOSS
2010
Springer
15 years 1 months ago
Programming Sensor Networks with State-Centric Services
This paper presents the uDSSP ("micro DSSP") programming model which simplifies the development of distributed sensor network applications that make use of complex in-net...
Andreas Lachenmann, Ulrich Müller, Robert Sug...
ICLP
2009
Springer
15 years 10 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
DAC
1999
ACM
15 years 2 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
CF
2010
ACM
15 years 2 months ago
Enabling a highly-scalable global address space model for petascale computing
Over the past decade, the trajectory to the petascale has been built on increased complexity and scale of the underlying parallel architectures. Meanwhile, software developers hav...
Vinod Tipparaju, Edoardo Aprà, Weikuan Yu, ...