Sciweavers

1951 search results - page 309 / 391
» An algorithm for improving graph partitions
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 9 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
EUROPAR
2010
Springer
15 years 5 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 4 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
VIS
2005
IEEE
146views Visualization» more  VIS 2005»
16 years 5 months ago
View Selection for Volume Rendering
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
Udeepta Bordoloi, Han-Wei Shen
SIGIR
2004
ACM
15 years 9 months ago
Block-based web search
Multiple-topic and varying-length of web pages are two negative factors significantly affecting the performance of web search. In this paper, we explore the use of page segmentati...
Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma