774 search results - page 114 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
ICDE
2004
IEEE
14 years 10 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
WEBI
2009
Springer
14 years 3 months ago
2009
Springer
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...