Sciweavers

2376 search results - page 195 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
DAC
2011
ACM
12 years 7 months ago
Rethinking memory redundancy: optimal bit cell repair for maximum-information storage
SRAM design has been a major challenge for nanoscale manufacturing technology. We propose a new bit cell repair scheme for designing maximum-information memory system (MIMS). Unli...
Xin Li
APVIS
2001
13 years 9 months ago
Building Virtual Worlds with the Big-Bang Model
Visualisations implemented as virtual worlds can allow users to comprehend large graphs more effectively. Good 3D layout algorithms are an important element. Angle has been develo...
Neville Churcher, Alan Creek
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Real scaled matching
Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scale...
Amihood Amir, Ayelet Butman, Moshe Lewenstein
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 7 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...