Sciweavers

72 search results - page 7 / 15
» Reply to Rao et al. and Lee et al
Sort
View
COMGEO
2006
ACM
14 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
ICALP
2009
Springer
15 years 10 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
AINA
2004
IEEE
15 years 1 months ago
Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chin-Chen Chang, Chu-Hsing Lin, Wei Lee, Pai-Cheng...
CSCW
2006
ACM
15 years 3 months ago
Going with the flow: email awareness and task management
Email use in the context of everyday work practices, or email flow, has not been heavily studied. We present the results of a pair of studies examining how users interlace email w...
Nelson Siu, Lee Iverson, Anthony Tang
LREC
2008
114views Education» more  LREC 2008»
14 years 11 months ago
A Study of Parentheticals in Discourse Corpora - Implications for NLG Systems
This paper presents a corpus study of parenthetical constructions in two different corpora: the Penn Discourse Treebank (PDTB, (PDTBGroup, 2008)) and the RST Discourse Treebank (C...
Eva Banik, Alan Lee