702 search results - page 76 / 141 » Identifying Graph Automorphisms Using Determining Sets |
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
107
click to vote
SIGMOD
1996
ACM
15 years 4 months ago
1996
ACM
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
ICDE
2009
IEEE
15 years 6 months ago
2009
IEEE
This demonstration presents Galaxy, a schema manager that facilitates easy and correct data sharing among autonomous but related, evolving data sources. Galaxy reduces heterogenei...
108
click to vote
BVAI
2005
Springer
15 years 5 months ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
145
click to vote
JMLR
2010
14 years 6 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...