2827 search results - page 328 / 566 » Robustness of PSPACE-complete sets |
154
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
194
click to vote
GRAPHICSINTERFACE
2001
15 years 8 months ago
2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
174
click to vote
HIS
2003
15 years 8 months ago
2003
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
184
click to vote
NIPS
2001
15 years 8 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
158
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...