113 search results - page 15 / 23 » When can a graph form an orthogonal polyhedron |
UAI
2008
13 years 8 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
UML
2000
Springer
13 years 11 months ago
2000
Springer
Software testing can only be formalized and quanti ed when a solid basis for test generation can be de ned. Tests are commonly generated from program source code, graphical models ...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
DATE
1997
IEEE
13 years 11 months ago
1997
IEEE
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...