Sciweavers

250 search results - page 8 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
SPIRE
2009
Springer
14 years 5 months ago
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
Yoram Bachrach, Ralf Herbrich, Ely Porat
EWC
2007
93views more  EWC 2007»
13 years 10 months ago
Approximation of involute curves for CAD-system processing
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
Fumitaka Higuchi, Shuichi Gofuku, Takashi Maekawa,...
CCS
2007
ACM
14 years 2 months ago
A framework for diversifying windows native APIs to tolerate code injection attacks
We present a framework to prevent code injection attacks in MS Windows using Native APIs in the operating system. By adopting the idea of diversity, this approach is implemented i...
Lynette Qu Nguyen, Tufan Demir, Jeff Rowe, Francis...
ECIR
2004
Springer
14 years 8 days ago
Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
Wolfram M. Esser
AMCS
2008
124views Mathematics» more  AMCS 2008»
13 years 11 months ago
Approximate Controllability of Infinite Dimensional Systems of the n-th Order
The objective of the article is to obtain general conditions for several types of controllability at once for an abstract differential equation of arbitrary order, instead of condi...
Jerzy Stefan Respondek