200 search results - page 23 / 40 » What Graphs can be Efficiently Represented by BDDs |
CVPR
1999
IEEE
14 years 9 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
COMCOM
2006
13 years 7 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Existing prediction methods in moving objects databases cannot forecast locations accurately if the query time is far away from the current time. Even for near future prediction, m...
CIAC
2010
Springer
13 years 10 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...