Sciweavers

194 search results - page 24 / 39
» The Polytope of Degree Partitions
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 7 days 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
AI
2007
Springer
14 years 12 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
JVM
2004
132views Education» more  JVM 2004»
15 years 1 months ago
Solaris Zones: Operating System Support for Server Consolidation
e a new operating system abstraction for partitioning systems, allowing multiple applications to run in isolation from each other on the same physical hardware. This isolation prev...
Andrew Tucker, David Comay
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 5 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...