Sciweavers

1442 search results - page 23 / 289
» Finding interesting things
Sort
View
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
14 years 2 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
José R. Correa, Cristina G. Fernandes, Mart...
ACL
2007
13 years 10 months ago
Finding document topics for improving topic segmentation
Topic segmentation and identification are often tackled as separate problems whereas they are both part of topic analysis. In this article, we study how topic identification can...
Olivier Ferret
AAAI
2004
13 years 10 months ago
Just How Mad Are You? Finding Strong and Weak Opinion Clauses
There has been a recent swell of interest in the automatic identification and extraction of opinions and emotions in text. In this paper, we present the first experimental results...
Theresa Wilson, Janyce Wiebe, Rebecca Hwa
ESWS
2010
Springer
14 years 1 months ago
Finding Your Way through the Rijksmuseum with an Adaptive Mobile Museum Guide
Abstract. This paper describes a real-time routing system that implements a mobile museum tour guide for providing personalized tours tailored to the user position inside the museu...
Willem Robert van Hage, Natalia Stash, Yiwen Wang,...
IPL
2008
82views more  IPL 2008»
13 years 8 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss