Sciweavers

1018 search results - page 89 / 204
» A Comparative Evaluation of Length Estimators
Sort
View
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
ACL
2010
15 years 4 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
EMNLP
2010
15 years 4 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
PKDD
2004
Springer
138views Data Mining» more  PKDD 2004»
15 years 11 months ago
Combining Multiple Clustering Systems
Three methods for combining multiple clustering systems are presented and evaluated, focusing on the problem of finding the correspondence between clusters of different systems. ...
Constantinos Boulis, Mari Ostendorf
BROADNETS
2004
IEEE
15 years 10 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...