Sciweavers

2127 search results - page 366 / 426
» Computing large matchings fast
Sort
View
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 days ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
ICALP
2009
Springer
16 years 4 days ago
Smoothed Analysis of Balancing Networks
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
WEBI
2009
Springer
15 years 6 months ago
Data Mining for Malicious Code Detection and Security Applications
: Data mining is the process of posing queries and extracting patterns, often previously unknown from large quantities of data using pattern matching or other reasoning techniques....
Bhavani M. Thuraisingham
INFOCOM
2008
IEEE
15 years 6 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
SASO
2008
IEEE
15 years 6 months ago
A Framework for Self-Protecting Cryptographic Key Management
Demands to match security with performance in Web applications where access to shared data needs to be controlled dynamically make self-protecting security schemes attractive. Yet...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl,...