Sciweavers

2600 search results - page 196 / 520
» Clustering with or without the Approximation
Sort
View
CHI
1993
ACM
15 years 10 months ago
Pictographic naming
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
Daniel P. Lopresti, Andrew Tomkins
ESANN
2001
15 years 8 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
TCS
2008
15 years 6 months ago
Curves and surfaces represented by polynomial support functions
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
Zbynek Sír, Jens Gravesen, Bert Jüttle...
TCS
2008
15 years 6 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...
TCS
2008
15 years 6 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang