Sciweavers

712 search results - page 30 / 143
» Sorting and selection on dynamic data
Sort
View
ICS
2004
Tsinghua U.
15 years 5 months ago
Scaling the issue window with look-ahead latency prediction
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Gl...
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 4 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
ICC
2009
IEEE
127views Communications» more  ICC 2009»
14 years 9 months ago
Starburst SSD: An Efficient Protocol for Selective Dissemination
Abstract--We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hie...
Tahir Azim, Qasim Mansoor, Philip Levis
DIS
2006
Springer
15 years 3 months ago
Optimal Bayesian 2D-Discretization for Variable Ranking in Regression
In supervised machine learning, variable ranking aims at sorting the input variables according to their relevance w.r.t. an output variable. In this paper, we propose a new relevan...
Marc Boullé, Carine Hue
ISSTA
2004
ACM
15 years 5 months ago
Where the bugs are
The ability to predict which files in a large software system are most likely to contain the largest numbers of faults in the next release can be a very valuable asset. To accomp...
Thomas J. Ostrand, Elaine J. Weyuker, Robert M. Be...