Sciweavers

864 search results - page 153 / 173
» A general markov framework for page importance computation
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
IMC
2004
ACM
14 years 2 months ago
Identifying elephant flows through periodically sampled packets
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jia...
SWS
2004
ACM
14 years 2 months ago
Applying hierarchical and role-based access control to XML documents
W3C Recommendations XML Encryption and XML-Digital Signature can be used to protect the confidentiality of and provide assurances about the integrity of XML documents transmitted...
Jason Crampton
ICAI
2004
13 years 10 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
ATAL
2010
Springer
13 years 10 months ago
Assignment problem in requirements driven agent collaboration and its implementation
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
Jian Tang, Zhi Jin