Sciweavers

42230 search results - page 412 / 8446
» Algorithms and Complexity Results for
Sort
View
TRUSTBUS
2010
Springer
15 years 4 months ago
Safe and Efficient Strategies for Updating Firewall Policies
Abstract. Due to the large size and complex structure of modern networks, firewall policies can contain several thousand rules. The size and complexity of these policies require au...
Zeeshan Ahmed, Abdessamad Imine, Michaël Rusi...
172
Voted
ICASSP
2011
IEEE
14 years 10 months ago
On the instantaneous frequency smoothing for signals with quasi-linear frequency changes
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
Maciej Niedzwiecki, Michal Stanislaw Meller
164
Voted
CORR
1998
Springer
84views Education» more  CORR 1998»
15 years 6 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 9 months ago
Robust Reputation-Based Ranking on Bipartite Rating Networks
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
Rong-Hua Li, Jeffrey Xu Yu, Xin Huang, Hong Cheng
CORR
2010
Springer
89views Education» more  CORR 2010»
15 years 7 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty