Sciweavers

2600 search results - page 403 / 520
» Clustering with or without the Approximation
Sort
View
GRAPHICSINTERFACE
1996
13 years 10 months ago
A Technique for Constructing Developable Surfaces
Paper, sheet metal, and many other materials are approximately unstretchable. The surfaces obtained by bending these materials can be flattened onto a plane without stretching or ...
Meng Sun, Eugene Fiume
OSDI
1996
ACM
13 years 10 months ago
Online Data-Race Detection via Coherency Guarantees
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
Dejan Perkovic, Peter J. Keleher
AAAI
1992
13 years 10 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
COLING
1992
13 years 10 months ago
Word-Sense Disambiguation Using Statistical Models of Roget's Categories Trained on Large Corpora
This paper describes a program that disambignates English word senses in unrestricted text using statistical models of the major Roget's Thesaurus categories. Roget's ca...
David Yarowsky
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
13 years 10 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski