Sciweavers

685 search results - page 75 / 137
» Succinct Trees in Practice
Sort
View
LREC
2008
98views Education» more  LREC 2008»
13 years 9 months ago
Deriving Rhetorical Complexity Data from the RST-DT Corpus
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...
Sandra Williams, Richard Power
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CN
2008
138views more  CN 2008»
13 years 7 months ago
Analysis of bandwidth efficiency in overlay multicasting
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...
Changhan Kim, Younghoon Kim, Jae-Heon Yang, Ikjun ...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2011
Springer
124views Education» more  CORR 2011»
13 years 2 months ago
Parallel Recursive State Compression for Free
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...