Sciweavers

3155 search results - page 190 / 631
» How Are You Doing
Sort
View
COLING
1996
13 years 10 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
BPSC
2009
152views Business» more  BPSC 2009»
13 years 10 months ago
A Formal Temporal Semantics for Microsoft Project based on Allen's Interval Algebra
Process modelling systems are complex and difficult to compare. A key attribute of any process modelling formalism or tool is time which involves how it handles and represents tem...
Denis Gagné, André Trudel
CSCW
2008
ACM
13 years 9 months ago
Unpacking Tasks: The Fusion of New Technology with Instructional Work
This paper discusses how a new technology (designed to help pupils with learning about Shakespeare's Macbeth) is introduced and integrated into existing classroom practices. I...
Christian Greiffenhagen
ECRA
2010
114views more  ECRA 2010»
13 years 9 months ago
Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by
This brief research commentary on Westland's (2010) article in this issue of Electronic Commerce Research and Applications is intended to add two cautionary notes. He attempts...
Andrew M. Odlyzko
DCG
2008
93views more  DCG 2008»
13 years 9 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...