Results 1  10
of
2,005
T.Golemanov: “Control Network Programming Illustrated: Solving Problems With Inherent GraphLike Structure
 In: Proc. 7th IEEE/ACIS Conf. on Computer and Information Science (ICIS 2008), May 2008
"... Control Network Programming (CNP) is a style of highlevel programming created to be especially convenient for solving problems with natural graphlike representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative of four ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Control Network Programming (CNP) is a style of highlevel programming created to be especially convenient for solving problems with natural graphlike representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative
Unitary dimension reduction for a class of selfadjoint extensions with applications to graphlike structures
 J. Math. Anal. Appl
"... ar ..."
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes
Merging GraphLike Object Structures
 In Proceedings of the Tenth International Workshop on Software Configuration Management
, 2001
"... This paper addresses the problem of coordinating a team of software developers concurrently working on a common software system. The standard approach to coordinate concurrent activities on a common set of data is locking. Any part of data used by one person is locked against concurrent use by anoth ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper addresses the problem of coordinating a team of software developers concurrently working on a common software system. The standard approach to coordinate concurrent activities on a common set of data is locking. Any part of data used by one person is locked against concurrent use by another person. The second person has to wait until the first person has finished his or her task and releases the lock. In databases, sophisticated locking and transaction concepts minimize the waiting times for concurrent users by offering different lock granularities and different locking levels (e.g. multiple read locks vs. single write locks). However, these locking strategies assume that locks are hold for relatively short times (some seconds), only. In software development...
Convolution Kernels on Discrete Structures
, 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract

Cited by 506 (0 self)
 Add to MetaCart
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes
Concept of a Label
"... Matching: given two graphlike structures (e.g., concept hierarchies or ontologies), produce a mapping between the nodes of the graphs that semantically correspond to each other ..."
Abstract
 Add to MetaCart
Matching: given two graphlike structures (e.g., concept hierarchies or ontologies), produce a mapping between the nodes of the graphs that semantically correspond to each other
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
to be shortest paths. The algorithm and its analysis are simple and intuitive, yet the algorithm runs as fast as any other known method on dense. graphs, achieving an O(n³) time bound on an nvertex graph. By incorporating the dynamic tree data structure of Sleator and Tarjan, we obtain a version
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1171 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Measurement and Analysis of Online Social Networks
 In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07
, 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract

Cited by 698 (14 self)
 Add to MetaCart
an opportunity to study the characteristics of online social network graphs at large scale. Understanding these graphs is important, both to improve current systems and to design new applications of online social networks. This paper presents a largescale measurement study and analysis of the structure
Generating Graphical Editors for Graphlike Data Structures
, 1999
"... Generating Graphical Editors for Graphlike Data Structures Many modern applications favor one or more graphical diagram editors, of which – despite their different look & feel and problem domains – on a closer look many have very similar functionality. Examples are UML class diagrams, finite au ..."
Abstract
 Add to MetaCart
Generating Graphical Editors for Graphlike Data Structures Many modern applications favor one or more graphical diagram editors, of which – despite their different look & feel and problem domains – on a closer look many have very similar functionality. Examples are UML class diagrams, finite
Results 1  10
of
2,005