Sciweavers

911 search results - page 40 / 183
» The New Promise of Analog Computation
Sort
View
CVPR
2003
IEEE
15 years 11 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
CHI
1993
ACM
15 years 10 months ago
Reducing the variability of programmers' performance through explained examples
A software tool called EXPLAINER has been developed for helping programmers perform new tasks by exploring previously worked-out examples. EXPLAINER is based on cognitive principl...
David F. Redmiles
KDD
2000
ACM
145views Data Mining» more  KDD 2000»
15 years 9 months ago
IntelliClean: a knowledge-based intelligent data cleaner
Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records wi...
Mong-Li Lee, Tok Wang Ling, Wai Lup Low
WETICE
1995
IEEE
15 years 9 months ago
Subdocument invocation semantics in collaborative hyperdocuments
In this paper we informally explain a new Trellis model that incorporates colored tokens into the previouslydescribed timed-Petri-net-based de nition. We give examples of using Tr...
Richard Furuta, Jaime Navon, P. David Stotts
JSC
2007
97views more  JSC 2007»
15 years 6 months ago
On approximate triangular decompositions in dimension zero
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
Marc Moreno Maza, Gregory J. Reid, Robin Scott, We...