Sciweavers

10414 search results - page 347 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
SCN
2008
Springer
136views Communications» more  SCN 2008»
15 years 6 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
TKDE
2008
136views more  TKDE 2008»
15 years 6 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
TMC
2011
149views more  TMC 2011»
15 years 1 months ago
Context-Based Network Estimation for Energy-Efficient Ubiquitous Wireless Connectivity
— Context information brings new opportunities for efficient and effective system resource management of mobile devices. In this work we focus on the use of context information t...
Ahmad Rahmati, Lin Zhong
IJCAI
2001
15 years 8 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
ICML
2005
IEEE
16 years 7 months ago
A smoothed boosting algorithm using probabilistic output codes
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
Rong Jin, Jian Zhang