199 search results - page 20 / 40 » Recognizing HHDS-Free Graphs |
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
APPROX
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
VR
2008
IEEE
13 years 9 months ago
2008
IEEE
It is widely recognized that inertial sensors, in particular gyroscopes, can improve the latency and accuracy of orientation tracking by fusing the inertial measurements with data...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
RE
2002
Springer
13 years 9 months ago
2002
Springer
This paper presents an extended version of GoalOriented Requirements Analysis Method called AGORA, where attribute values, e.g. contribution values and preference matrices, are ad...