Sciweavers

4526 search results - page 309 / 906
» Algorithmic problems related to the Internet
Sort
View
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 8 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson
INFORMATICASI
2002
91views more  INFORMATICASI 2002»
15 years 6 months ago
Using Image Segmentation as a Basis for Categorization
Image categorization is the problem of classifying images into one or more of several possible categories or classes, which are defined in advance. Classifiers can be trained usin...
Janez Brank
CP
1999
Springer
15 years 11 months ago
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Youssef Hamadi
AAAI
2008
15 years 9 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CCCG
2006
15 years 8 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison