Sciweavers

2009 search results - page 394 / 402
» Dense Interest Points
Sort
View
TRIER
2002
13 years 7 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm
PE
2007
Springer
114views Optimization» more  PE 2007»
13 years 7 months ago
Performance analysis of BitTorrent-like systems with heterogeneous users
Among all peer-to-peer (P2P) systems, BitTorrent seems to be the most prevalent one. This success has drawn a great deal of research interest on the system. In particular, there h...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
PR
2007
141views more  PR 2007»
13 years 7 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
PVLDB
2008
107views more  PVLDB 2008»
13 years 7 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 6 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák