## SEARCH

#### Country

##### ( see all 169)

- United States 111090 (%)
- Germany 86368 (%)
- China 66335 (%)
- United Kingdom 54969 (%)

#### Institution

##### ( see all 215222)

- University of California 5345 (%)
- Chinese Academy of Sciences 4571 (%)
- Carnegie Mellon University 3989 (%)
- Tsinghua University 3814 (%)
- Technische Universität München 2872 (%)

#### Author

##### ( see all 628848)

- Shekhar, Shashi 1297 (%)
- Xiong, Hui 1255 (%)
- MacDonald, Matthew 1217 (%)
- Freeman, Adam 884 (%)
- Troelsen, Andrew 536 (%)

#### Publication

##### ( see all 17050)

- Computer Science and Communications Dictionary 21379 (%)
- Multimedia Tools and Applications 5742 (%)
- Scientometrics 5248 (%)
- Encyclopedia of Database Systems 4453 (%)
- Neural Information Processing 3745 (%)

#### Subject

##### ( see all 685)

- Computer Science [x] 869980 (%)
- Artificial Intelligence (incl. Robotics) 303956 (%)
- Computer Communication Networks 216814 (%)
- Information Systems Applications (incl. Internet) 201663 (%)
- Algorithm Analysis and Problem Complexity 147919 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 11 to 20 of 869980 matching Articles
Results per page:

## A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

### SOFSEM 2012: Theory and Practice of Computer Science (2012-01-01): 7147 , January 01, 2012

We consider the problem of computing all-pairs shortest paths in a directed graph with non-negative real weights assigned to vertices.

For an *n*×*n* 0 − 1 matrix *C*, let *K*_{C} be the complete weighted graph on the rows of *C* where the weight of an edge between two rows is equal to their Hamming distance. Let *MWT*(*C*) be the weight of a minimum weight spanning tree of *K*_{C}.

We show that the all-pairs shortest path problem for a directed graph *G* on *n* vertices with non-negative real weights and adjacency matrix *A*_{G} can be solved by a combinatorial randomized algorithm in time
$$\widetilde{O}(n^{2}\sqrt{n + \min\{MWT(A_G), MWT(A_G^t)\}})$$
As a corollary, we conclude that the transitive closure of a directed graph *G* can be computed by a combinatorial randomized algorithm in the aforementioned time.

We also conclude that the all-pairs shortest path problem for vertex-weighted uniform disk graphs induced by point sets of bounded density within a unit square can be solved in time $\widetilde{O}(n^{2.75})$ .

## Objects and Classes

### Learning to Program the Object-oriented Way with C# (2002-01-01): 1-22 , January 01, 2002

This chapter:

introduces the object-oriented approach to computer programming

describes how object-oriented programs are made up of collections of interacting objects

describes how objects are defined by the class to which they belong

describes how to define a new class of objects in C#…

… and how to write a C# program that uses this class

## Polymorphic Abstract Syntax via Grothendieck Construction

### Foundations of Software Science and Computational Structures (2011-01-01) 6604: 381-395 , January 01, 2011

Abstract syntax with variable binding is known to be characterised as an initial algebra in a presheaf category. This paper extends it to the case of polymorphic typed abstract syntax with binding. We consider two variations, second-order and higher-order polymorphic syntax. The central idea is to apply Fiore’s initial algebra characterisation of typed abstract syntax with binding repeatedly, i.e. first to the type structure and secondly to the term structure of polymorphic system. In this process, we use the Grothendieck construction to combine differently staged categories of polymorphic contexts.

## Message Transmission Scheduling on Tandem Multi-hop Lossy Wireless Links

### Wired/Wireless Internet Communications (2016-01-01): 9674 , January 01, 2016

This paper proposes a framework for message transmission scheduling on a simple tandem multi-hop transmission model with lossy unreliable wireless links, where each of *N* nodes periodically generates a message every *T* time-slots. Such a model is of practical importance, e.g., in low-cost serially-arranged sensor networks in the wild. Each message can be transmitted to an adjacent in a single time-slot, and should be relayed in a store-wait-and-forward manner from its source node to one of gateways at the edges of the tandem within *T* time-slots. Our framework consists of: (i) a static global time-slot assignment over all links analytically derived by a central server; and (ii) a local message selection for transmission with a simple XOR network coding-based proactive recovery over assigned time-slots on each link. Simulation results show the probability that all messages are successfully delivered to the server (via gateways) by the proposed framework is comparable to or even better than that by ACK-based reactive recovery schemes.

## Front Matter - Mobile Wireless Middleware, Operating Systems, and Applications

### Mobile Wireless Middleware, Operating Systems, and Applications (2010-01-01): 48 , January 01, 2010

## Front Matter - Applied Parallel and Scientific Computing

### Applied Parallel and Scientific Computing (2013-01-01): 7782 , January 01, 2013

## Modeling of the Students Scenario on a Learning Course

### Knowledge-Based Intelligent Information and Engineering Systems (2008-01-01): 5177 , January 01, 2008

Adjusting the content to each student is a major issue in e-Learning. From this viewpoint, a learning course as a series of content also must be adjusted according to the performance of the students. We propose a method that combines clustering and decision tree learning for constructing scenarios of the students’ actions. The global statuses of the students are reflected to the clusters, and the local and sequential actions of the students are reflected to the decision trees. The results of e-Learning tests gathered from Japanese junior high school students was processed by our proposed method. We graded the clusters by adaptation to the trees, and selected a set of clusters as a scenario for the students. These scenarios have a possibility of aiding the adjustment, and revision of learning courses.

## Back Matter - Algebraic and Logic Programming

### Algebraic and Logic Programming (1997-01-01): 1298 , January 01, 1997

## Dependability Evaluation of The Ogsa-Dai Middleware

### Achievements in European Research on Grid Systems (2008-01-01): 223-236 , January 01, 2008

One important contribution to the community that is developing Grid middleware is the definition and implementation of benchmarks and tools to assess the performance and dependability of Grid applications and the corresponding middleware. In this paper, we present an experimental study that was conducted with OGSA-DAI, a popular package of middleware that provides access to remote data resources thought a unified Web-service front-end. The results show that OGSA-DAI is quite stable and performed quite well in scalability tests, executed on Grid5000. However, we also demonstrate that OGSA-DAI WSI is currently using a SOAP container (Apache Axis1.2.1) that suffers from severe memory leaks. We show how the default configuration of OGSA-DAI is not affected by that problem, but a small change in the configuration of a Web-service may lead to very unreliable execution of OGSA-DAI.