Sciweavers

215 search results - page 40 / 43
» On the number of factorizations of a full cycle
Sort
View
MM
2004
ACM
94views Multimedia» more  MM 2004»
14 years 25 days ago
Towards automated story analysis using participatory design
Involving a school teacher in the development of the intelligent writing tutor StoryStation allowed progress to be made on the problem of story classification, an aspect of story...
Harry Halpin, Johanna D. Moore, Judy Robertson
PLDI
2004
ACM
14 years 25 days ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
SENSYS
2004
ACM
14 years 25 days ago
Mitigating congestion in wireless sensor networks
Network congestion occurs when offered traffic load exceeds available capacity at any point in a network. In wireless sensor networks, congestion causes overall channel quality t...
Bret Hull, Kyle Jamieson, Hari Balakrishnan
COMPGEOM
2010
ACM
14 years 15 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
GECCO
2010
Springer
170views Optimization» more  GECCO 2010»
14 years 6 days ago
Improving reliability of embedded systems through dynamic memory manager optimization using grammatical evolution
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...
José Manuel Colmenar, José L. Risco-...