Sciweavers

13987 search results - page 426 / 2798
» The Two Guards Problem
Sort
View
NPL
2008
100views more  NPL 2008»
15 years 6 months ago
Comparing Combination Rules of Pairwise Neural Networks Classifiers
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
Olivier Lezoray, Hubert Cardot
IJAIT
2002
81views more  IJAIT 2002»
15 years 6 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 9 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICALP
2005
Springer
16 years 13 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos