Sciweavers

5220 search results - page 1000 / 1044
» Changing Persistent Applications
Sort
View
CIKM
2006
Springer
15 years 3 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
PASTE
2010
ACM
15 years 3 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
ESWS
2008
Springer
15 years 3 months ago
Rabbit: Developing a Control Natural Language for Authoring Ontologies
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...
Glen Hart, Martina Johnson, Catherine Dolbear
EUROISI
2008
15 years 3 months ago
Buzz Monitoring in Word Space
This paper discusses the task of tracking mentions of some topically interesting textual entity from a continuously and dynamically changing flow of text, such as a news feed, the ...
Magnus Sahlgren, Jussi Karlgren
ATMOS
2008
101views Optimization» more  ATMOS 2008»
15 years 3 months ago
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
The problem of robust line planning requests for a set of origin-destination paths (lines) along with their traffic rates (frequencies) in an underlying railway network infrastruct...
Spyros C. Kontogiannis, Christos D. Zaroliagis
« Prev « First page 1000 / 1044 Last » Next »