Sciweavers

686 search results - page 104 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
EMMCVPR
2011
Springer
12 years 8 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
JMLR
2012
11 years 11 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
MOBIHOC
2007
ACM
14 years 8 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi
WWW
2003
ACM
14 years 9 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...