Sciweavers

648 search results - page 121 / 130
» Lowness for Demuth Randomness
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CHI
1993
ACM
14 years 1 months ago
Exploring the applications of user-expertise assessment for intelligent interfaces
An adaptive user interface relies, to a large extent, upon an adequate user model (e.g., a representationof user-expertise). However, building a user model may be a tedious and ti...
Michel Desmarais, Jiming Liu
CCGRID
2004
IEEE
14 years 1 months ago
Effective use of reputation in peer-to-peer environments
Peer-to-peer environments have become popular as a framework for exchange of services. In these environments, certain peers may fail to provide their services. Reputation can be a...
Thanasis G. Papaioannou, George D. Stamoulis
DCOSS
2006
Springer
14 years 1 months ago
Comparative Analysis of Push-Pull Query Strategies for Wireless Sensor Networks
Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-c...
Shyam Kapadia, Bhaskar Krishnamachari
NSDI
2008
14 years 4 days ago
Phalanx: Withstanding Multimillion-Node Botnets
Large-scale distributed denial of service (DoS) attacks are an unfortunate everyday reality on the Internet. They are simple to execute and with the growing prevalence and size of...
Colin Dixon, Thomas E. Anderson, Arvind Krishnamur...