Sciweavers

207 search results - page 13 / 42
» A Computational Mechanism for Pronominal Reference
Sort
View
DSN
2005
IEEE
14 years 1 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
HPDC
1999
IEEE
13 years 11 months ago
Baglets: Adding Hierarchical Scheduling to Aglets
A significant number of new Java-based technologies for mobile code (aka agents) have recently emerged. The 'Aglets' system, from IBM's research labs, provides an e...
Arvind Gopalan, Sajid Saleem, Matthias Martin, Dan...
IC3
2009
13 years 5 months ago
IDChase: Mitigating Identifier Migration Trap in Biological Databases
A convenient mechanism to refer to large biological objects such as sequences, structures and networks is the use of identifiers or handles, commonly called IDs. IDs function as a ...
Anupam Bhattacharjee, Aminul Islam, Hasan M. Jamil...
ICN
2001
Springer
13 years 12 months ago
Supporting QoS for Legacy Applications
Internet is widely known for lacking any kind of mechanism for the provisioning of Quality of Service (QoS) guarantees. The Internet community currently concentrates its efforts on...
Charilaos A. Tsetsekas, Sotirios Maniatis, Iakovos...
ICPR
2008
IEEE
14 years 1 months ago
Image quality assessment with visual attention
Image quality assessment (IQA) is of great importance for many image processing applications. Some IQA indexes proposed recently more or less try to boost their performance to acc...
Qi Ma, Liming Zhang