Sciweavers

1941 search results - page 333 / 389
» On the Hardness of Approximate Reasoning
Sort
View
SIGSOFT
2002
ACM
16 years 17 days ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
WWW
2009
ACM
16 years 15 days ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
WWW
2008
ACM
16 years 15 days ago
Information "uptrieval": exploring models for content assimilation and aggregation for developing regions
Information Retrieval on the WWW is important because it is hard to find what one is looking for. There is a plethora of information available, and searching relevant information ...
Sheetal K. Agarwal, Arun Kumar, Sougata Mukherjea,...
ECOOP
2009
Springer
16 years 14 days ago
Failboxes: Provably Safe Exception Handling
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
Bart Jacobs 0002, Frank Piessens
ASPLOS
2009
ACM
16 years 14 days ago
TwinDrivers: semi-automatic derivation of fast and safe hypervisor network drivers from guest OS drivers
In a virtualized environment, device drivers are often run inside a virtual machine (VM) rather than in the hypervisor, for reasons of safety and reduction in software engineering...
Aravind Menon, Simon Schubert, Willy Zwaenepoel