Sciweavers

2612 search results - page 101 / 523
» Switching Graphs and Their Complexity
Sort
View
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
15 years 10 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
IVC
2002
143views more  IVC 2002»
14 years 9 months ago
Towards the automatic analysis of complex human body motions
The classification of human body motion is an integral component for the automatic interpretation of video sequences. In a first part we present an effective approach that uses mi...
Jens Rittscher, Andrew Blake, Stephen J. Roberts
IWPC
2010
IEEE
14 years 8 months ago
DepDigger: A Tool for Detecting Complex Low-Level Dependencies
We present a tool that identifies complex data-flow dependencies on code-level, based on the measure dep-degree. Low-level dependencies between program operations are modeled by...
Dirk Beyer, Ashgan Fararooy
WAIM
2010
Springer
14 years 8 months ago
HyperGraphDB: A Generalized Graph Database
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
Borislav Iordanov
DAM
2002
82views more  DAM 2002»
14 years 9 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian