Sciweavers

241 search results - page 16 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
FIT: fast Internet traceback
— Traceback mechanisms are a critical part of the defense against IP spoofing and DoS attacks, as well as being of forensic value to law enforcement. Currently proposed IP trace...
Abraham Yaar, Adrian Perrig, Dawn Xiaodong Song
ECML
2006
Springer
15 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
COMCOM
2002
112views more  COMCOM 2002»
14 years 9 months ago
Decoupling different time scales of network QoS systems
Providing quality of service (QoS) in large-scale networks like the Internet inherently needs to deal with heterogeneous network QoS systems. Therefore, the interworking between d...
Jens Schmitt, Oliver Heckmann, Martin Karsten, Ral...
87
Voted
ICCV
2009
IEEE
14 years 7 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
106
Voted
TON
2008
125views more  TON 2008»
14 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni