Sciweavers

2925 search results - page 1 / 585
» Information Complexity of Online Problems
Sort
View
MFCS
2010
Springer
13 years 3 months ago
Information Complexity of Online Problems
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
Juraj Hromkovic, Rastislav Královic, Richar...
ICALP
2011
Springer
12 years 8 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ESANN
2006
13 years 6 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
13 years 11 months ago
Clustering Events on Streams Using Complex Context Information
Monitoring applications play an increasingly important role in many domains. They detect events in monitored systems and take actions such as invoke a program or notify an adminis...
YongChul Kwon, Wing Yee Lee, Magdalena Balazinska,...
IJCGA
2010
155views more  IJCGA 2010»
13 years 3 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon