Sciweavers

9949 search results - page 1790 / 1990
» On the Network Complexity of Selection
Sort
View
JAIR
2011
214views more  JAIR 2011»
14 years 9 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...
MLMI
2004
Springer
15 years 12 months ago
Towards Predicting Optimal Fusion Candidates: A Case Study on Biometric Authentication Tasks
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
Norman Poh, Samy Bengio
ASIAN
2005
Springer
178views Algorithms» more  ASIAN 2005»
16 years 8 hour ago
An Approach for Service Discovery Based on Semantic Peer-to-Peer
The service discovery is a key step during Peer-to-Peer (P2P) converging with Web Service. In this paper, a semantic-P2P based approach is presented for web service discovery. To e...
Hao Wu, Hai Jin, Yunfa Li, Hanhan Chen
ANCS
2009
ACM
15 years 4 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao

Publication
200views
17 years 5 months ago
Dynamic Queue Control Functions for ATM ABR Switch Schemes: Design and Analysis
The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady...
Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia Fahm...
« Prev « First page 1790 / 1990 Last » Next »