Sciweavers

5463 search results - page 1028 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
CIKM
2005
Springer
15 years 6 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
102
Voted
DAC
2006
ACM
16 years 1 months ago
Prediction-based flow control for network-on-chip traffic
Networks-on-Chip (NoC) architectures provide a scalable solution to on-chip communication problem but the bandwidth offered by NoCs can be utilized efficiently only in presence of...
Ümit Y. Ogras, Radu Marculescu
102
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 26 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
BROADNETS
2004
IEEE
15 years 4 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
143
Voted
MICCAI
2010
Springer
14 years 10 months ago
Groupwise Registration by Hierarchical Anatomical Correspondence Detection
Groupwise registration has been widely investigated in recent years due to its importance in analyzing population data in many clinical applications. To our best knowledge, most o...
Guorong Wu, Qian Wang, Hongjun Jia, Dinggang Shen
« Prev « First page 1028 / 1093 Last » Next »