Sciweavers

1241 search results - page 70 / 249
» Path-oriented random testing
Sort
View
136
Voted
CVPR
2005
IEEE
16 years 4 months ago
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...
Dragomir Anguelov, Benjamin Taskar, Vassil Chatalb...
WWW
2008
ACM
16 years 3 months ago
Video suggestion and discovery for youtube: taking random walks through the view graph
The rapid growth of the number of videos in YouTube provides enormous potential for users to find content of interest to them. Unfortunately, given the difficulty of searching vid...
Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Ji...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 2 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
166
Voted
PLDI
2009
ACM
15 years 9 months ago
A randomized dynamic program analysis technique for detecting real deadlocks
We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded programs. Our technique runs in two stages. In the first stage, we use an imprecise dyn...
Pallavi Joshi, Chang-Seo Park, Koushik Sen, Mayur ...
98
Voted
CLUSTER
2006
IEEE
15 years 8 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...