Results 1  10
of
5,997
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 579 (3 self)
 Add to MetaCart
pipelining is that optimal performance can be achieved with compact object code. This paper extends previous results of software pipelining in two ways: First, this paper shows that by using an improved algorithm, nearoptimal performance can be obtained without specialized hardware. Second, we propose a
The Landscape of Parallel Computing Research: A View from Berkeley
 TECHNICAL REPORT, UC BERKELEY
, 2006
"... ..."
ControlFlow Analysis of HigherOrder Languages
, 1991
"... representing the official policies, either expressed or implied, of ONR or the U.S. Government. Keywords: dataflow analysis, Scheme, LISP, ML, CPS, type recovery, higherorder functions, functional programming, optimising compilers, denotational semantics, nonstandard Programs written in powerful, ..."
Abstract

Cited by 362 (10 self)
 Add to MetaCart
that runs slower than their FORTRAN and C counterparts. The problem is the lack of an explicit controlflow graph at compile time, something which traditional dataflow analysis techniques require. In this dissertation, I present a technique for recovering the controlflow graph of a Scheme program
The topological vertex
, 2003
"... We construct a cubic field theory which provides all genus amplitudes of the topological Amodel for all noncompact toric CalabiYau threefolds. The topology of a given Feynman diagram encodes the topology of a fixed CalabiYau, with Schwinger parameters playing the role of Kähler classes of the th ..."
Abstract

Cited by 169 (24 self)
 Add to MetaCart
We construct a cubic field theory which provides all genus amplitudes of the topological Amodel for all noncompact toric CalabiYau threefolds. The topology of a given Feynman diagram encodes the topology of a fixed CalabiYau, with Schwinger parameters playing the role of Kähler classes of the threefold. We interpret this result as an operatorial computation of the amplitudes in the Bmodel mirror which is the quantum KodairaSpencer theory. The only degree of freedom of this theory is an unconventional chiral scalar on a Riemann surface. In this setup we identify the Bbranes on the mirror Riemann
Coresets in Dynamic Geometric Data Streams
, 2005
"... A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)approximation algorithms for kmedian, kmeans, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), m ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)approximation algorithms for kmedian, kmeans, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (Max
Diversity Maximization via Composable Coresets
"... Given a set S of points in a metric space, and a diversity measure div(·) defined over subsets of S, the goal of the diversity maximization problem is to find a subset T ⊆ S of size k that maximizes div(T). Motivated by applications in massive data processing, we consider the composable coreset fr ..."
Abstract
 Add to MetaCart
Given a set S of points in a metric space, and a diversity measure div(·) defined over subsets of S, the goal of the diversity maximization problem is to find a subset T ⊆ S of size k that maximizes div(T). Motivated by applications in massive data processing, we consider the composable coreset
Results 1  10
of
5,997