Sciweavers

796 search results - page 85 / 160
» Problem Generation: Evaluation of Two Domains in Operating S...
Sort
View
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
INFOCOM
2012
IEEE
13 years 6 days ago
Reverse-engineering BitTorrent: A Markov approximation perspective
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...
CISISSPAIN
2011
14 years 1 months ago
Testing Ensembles for Intrusion Detection: On the Identification of Mutated Network Scans
In last decades there have been many proposals from the machine learning community in the intrusion detection field. One of the main problems that Intrusion Detection Systems (IDSs...
Silvia González, Javier Sedano, Álva...
DASFAA
2006
IEEE
220views Database» more  DASFAA 2006»
15 years 3 months ago
KEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation ...
Zheng Zhang, Shuigeng Zhou, Weining Qian, Aoying Z...
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...