Sciweavers

3105 search results - page 404 / 621
» The Path-Packing Structure of Graphs
Sort
View
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
15 years 4 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...
IS
2007
15 years 4 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
CGF
1999
125views more  CGF 1999»
15 years 3 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
ATVA
2010
Springer
142views Hardware» more  ATVA 2010»
15 years 2 months ago
On Scenario Synchronization
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla
IPPS
2010
IEEE
15 years 2 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader