Sciweavers

4377 search results - page 644 / 876
» Mass problems and randomness
Sort
View
ICSE
2011
IEEE-ACM
14 years 10 months ago
A framework for automated testing of javascript web applications
Current practice in testing JavaScript web applications requires manual construction of test cases, which is difficult and tedious. We present a framework for feedback-directed a...
Shay Artzi, Julian Dolby, Simon Holm Jensen, Ander...
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICCV
2011
IEEE
14 years 6 months ago
Learning Cross-modality Similarity for Multinomial Data
Many applications involve multiple-modalities such as text and images that describe the problem of interest. In order to leverage the information present in all the modalities, on...
Yangqing Jia, Mathieu Salzmann, Trevor Darrell
EMMCVPR
2011
Springer
14 years 6 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
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala