Sciweavers

28888 search results - page 5721 / 5778
» Computability and complexity in analysis
Sort
View
CCS
2008
ACM
15 years 5 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
167
Voted
CCS
2008
ACM
15 years 5 months ago
The risk-utility tradeoff for IP address truncation
Network operators are reluctant to share traffic data due to security and privacy concerns. Consequently, there is a lack of publicly available traces for validating and generaliz...
Martin Burkhart, Daniela Brauckhoff, Martin May, E...
CCS
2008
ACM
15 years 5 months ago
Efficiently tracking application interactions using lightweight virtualization
In this paper, we propose a general-purpose framework that harnesses the power of lightweight virtualization to track applications interactions in a scalable an efficient manner. ...
Yih Huang, Angelos Stavrou, Anup K. Ghosh, Sushil ...
CIKM
2008
Springer
15 years 5 months ago
Probabilistic polyadic factorization and its application to personalized recommendation
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
Yun Chi, Shenghuo Zhu, Yihong Gong, Yi Zhang
DIAGRAMS
2006
Springer
15 years 5 months ago
From Diagrams to Models by Analogical Transfer
Abstract. We present a method for constructing a teleological model of a drawing of a physical device through analogical transfer of the teleological model of the same device in an...
Patrick W. Yaner, Ashok K. Goel
« Prev « First page 5721 / 5778 Last » Next »