Sciweavers

5221 search results - page 283 / 1045
» An On-line Problem Database
Sort
View
PAMI
2006
164views more  PAMI 2006»
15 years 6 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
PAMI
2011
15 years 1 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ER
2007
Springer
89views Database» more  ER 2007»
16 years 24 days ago
On Order Dependencies for the Semantic Web
We consider the problem of adding both equality and order generating dependencies to Web ontology languages such as OWL DL that are based on description logics. Such dependencies u...
David Toman, Grant E. Weddell
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
15 years 6 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
JCS
2000
148views more  JCS 2000»
15 years 6 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton