Sciweavers

2563 search results - page 341 / 513
» Parallel matrix algorithms and applications
Sort
View
147
Voted
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
15 years 5 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang
106
Voted
JAR
1998
60views more  JAR 1998»
15 years 3 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
IPPS
2003
IEEE
15 years 9 months ago
Applying Aspect-Orient Programming Concepts to a Component-Based Programming Model
Abstract— The execution environments For scientific applications have evolved significantly over the years. Vector and parallel architectures have provided significantly faste...
Thomas Eidson, Jack Dongarra, Victor Eijkhout
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 4 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 4 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni