Sciweavers

312 search results - page 28 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
INFOCOM
2000
IEEE
13 years 11 months ago
A Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
Thomas Y. C. Woo
COLT
2001
Springer
14 years 1 days ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
SEBD
2003
154views Database» more  SEBD 2003»
13 years 9 months ago
Management of User Preferences in Data Intensive Applications
Abstract. The management of user preferences is becoming a fundamental ingredient of modern Web-based data-intensive applications, in which information filtering is crucial to red...
Riccardo Torlone, Paolo Ciaccia
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
13 years 6 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti