Sciweavers

42 search results - page 2 / 9
» Tag Elimination and Jones-Optimality
Sort
View
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
13 years 10 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin
PLDI
1998
ACM
13 years 9 months ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning
ICPP
2007
IEEE
13 years 11 months ago
VIRE: Active RFID-based Localization Using Virtual Reference Elimination
RFID technologies are gaining much attention as they are attractive solutions to many application domains. Localization based on active RFID technologies provides a much needed ad...
Yiyang Zhao, Yunhao Liu, Lionel M. Ni
HT
2010
ACM
13 years 7 months ago
Connecting users and items with weighted tags for personalized item recommendations
1 Tags are an important information source in Web 2.0. They can be used to describe users’ topic preferences as well as the content of items to make personalized recommendations....
Huizhi Liang, Yue Xu, Yuefeng Li, Richi Nayak, Xia...
LFP
1992
140views more  LFP 1992»
13 years 6 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein