425 search results - page 11 / 85 » Polynomial Time Data Reduction for Dominating Set |
TCS
1998
14 years 9 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
CEC
2008
IEEE
15 years 3 months ago
2008
IEEE
—In this paper, we proposed a reduced polynomial neural swarm net (RPNSN) for the task of classification. Classification task is one of the most studied tasks of data mining. In ...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
3DPVT
2004
IEEE
15 years 1 months ago
2004
IEEE
Modern automatic digitizers can sample huge amounts of 3D data points on the object surface in a short time. Point based graphics is becoming a popular framework to reduce the car...
IOR
2010
14 years 7 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...