Sciweavers

2705 search results - page 354 / 541
» Privacy in Data Mining Using Formal Methods
Sort
View
FMCAD
2009
Springer
16 years 1 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
ISI
2004
Springer
15 years 12 months ago
A Tool for Internet Chatroom Surveillance
Internet chatrooms are common means of interaction and communications, and they carry valuable information about formal or ad-hoc formation of groups with diverse objectives. This ...
Seyit Ahmet Çamtepe, Mukkai S. Krishnamoort...
POPL
1999
ACM
15 years 10 months ago
JFlow: Practical Mostly-Static Information Flow Control
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work...
Andrew C. Myers
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
16 years 7 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
16 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert