Sciweavers

6598 search results - page 304 / 1320
» Graph Theory with Applications
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ICRA
2005
IEEE
111views Robotics» more  ICRA 2005»
16 years 7 days ago
A New Formalism to Characterize Contact States Involving Articulated Polyhedral Objects
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
Ernesto Staffetti, Wim Meeussen, Jing Xiao
DOCENG
2003
ACM
15 years 12 months ago
Handling syntactic constraints in a DTD-compliant XML editor
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Y. S. Kuo, Jaspher Wang, N. C. Shih
CIE
2008
Springer
15 years 8 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova
DC
2002
15 years 6 months ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...