Sciweavers

11211 search results - page 1652 / 2243
» Rank-Sensitive Data Structures
Sort
View
ANLP
2000
124views more  ANLP 2000»
15 years 8 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
COLING
2000
15 years 8 months ago
Corpus-dependent Association Thesauri for Information Retrieval
This paper presents a method for automatically generating an association thesaurus from a text corpus, and demonstrates its application to information retrieval. The thesaurus gen...
Hiroyuki Kaji, Yasutsugu Morimoto, Toshiko Aizono,...
ECIS
2000
15 years 8 months ago
Towards a Secure Web-Based Health Care Application
Even though security requirements in health care are traditionally high, most computerized health care applications lack sophisticated security measures or focus only on single sec...
Susanne Röhrig, Konstantin Knorr
CRIWG
1997
15 years 8 months ago
CLASS: A Computer Platform for the Development of Education's Collaborative Applications
In spite of the important development that the Web has gone through in the last years, the field of education has not taken fully advantage of this development. Using this technol...
Luis A. Guerrero, David A. Fuller
SIROCCO
1998
15 years 8 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer
« Prev « First page 1652 / 2243 Last » Next »