Sciweavers

12825 search results - page 128 / 2565
» Improved PLSOM algorithm
Sort
View
140
Voted
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 10 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
GIS
2009
ACM
15 years 9 months ago
Focus+Glue+Context: an improved fisheye approach for web map services
This paper proposes a method for generating a Focus+Glue +Context map for Web map services by improving existing fisheye views methods for cartographic data. While many studies h...
Daisuke Yamamoto, Shotaro Ozeki, Naohisa Takahashi
KDD
2009
ACM
245views Data Mining» more  KDD 2009»
16 years 5 months ago
Mining rich session context to improve web search
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
Guangyu Zhu, Gilad Mishne
152
Voted
IEEEPACT
2009
IEEE
15 years 11 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 11 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop