Sciweavers

5214 search results - page 21 / 1043
» The Online Specialization Problem
Sort
View
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
IWANN
2007
Springer
14 years 1 months ago
The Impact of Cognitive Navigation Assistance on People with Special Needs
The global trend of increasing longevity of modern societies is causing a growing attention to the elderly citizens. The world elderly population’s needs create the conditions fo...
Roberta Annicchiarico, Ulises Cortés, Aless...
COLING
2000
13 years 9 months ago
Automatic Extraction of Semantic Relations from Specialized Corpora
In this paper we address the problem of discovering word semantic similarities via statistical processing of text corpora. We propose a knowledge-poor method that exploits the sen...
Aristomenis Thanopoulos, Nikos Fakotakis, George K...
ICALP
2000
Springer
13 years 11 months ago
Optimal Projective Algorithms for the List Update Problem
The list update problem is a classical online problem, with an optimal competi
Christoph Ambühl, Bernd Gärtner, Bernhar...
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
13 years 9 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara