Sciweavers

12519 search results - page 4 / 2504
» Approximation Problems Categories
Sort
View
TCS
2002
13 years 8 months ago
Restriction categories I: categories of partial maps
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
J. Robin B. Cockett, Stephen Lack
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 8 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
JOLLI
2010
78views more  JOLLI 2010»
13 years 7 months ago
On the Membership Problem for Non-Linear Abstract Categorial Grammars
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
Sylvain Salvati
JMLR
2010
88views more  JMLR 2010»
13 years 3 months ago
Unsupervised Aggregation for Classification Problems with Large Numbers of Categories
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
JUCS
2007
137views more  JUCS 2007»
13 years 8 months ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu