1779 search results - page 130 / 356 » A Formal Model of Data Privacy |
156
click to vote
VISUALIZATION
1994
IEEE
15 years 8 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
179
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
174
click to vote
SIGIR
2011
ACM
2011
ACM
Find it if you can: a game for modeling different types of web search success using interaction data
14 years 7 months ago
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
244
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
130
click to vote
CAISE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Modern process-aware information systems store detailed information about processes as they are being executed. This kind of information can be used for very different p...