Sciweavers

2498 search results - page 343 / 500
» Data Structures with Unpredictable Timing
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
ACL
1997
15 years 7 months ago
Contrastive Accent in a Data-to-Speech System
Being able to predict the placement of contrastive accent is essential for the assignment of correct accentuation patterns in spoken language generation. I discuss two approaches ...
Mariët Theune
BMCBI
2007
119views more  BMCBI 2007»
15 years 6 months ago
Conceptual-level workflow modeling of scientific experiments using NMR as a case study
Background: Scientific workflows improve the process of scientific experiments by making computations explicit, underscoring data flow, and emphasizing the participation of humans...
Kacy K. Verdi, Heidi J. C. Ellis, Michael R. Gryk
FLAIRS
2008
15 years 8 months ago
Learning in the Lexical-Grammatical Interface
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
15 years 8 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...