Sciweavers

979 search results - page 113 / 196
» Footprints in Local Reasoning
Sort
View
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
13 years 5 months ago
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
Daniel Munoz, Nicolas Vandapel, Martial Hebert
CVPR
2009
IEEE
15 years 2 months ago
Understanding Images of Groups of People
In many social settings, images of groups of people are captured. The structure of this group provides meaningful context for reasoning about individuals in the group, and about th...
Andrew C. Gallagher, Tsuhan Chen
CC
2011
Springer
267views System Software» more  CC 2011»
12 years 11 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
ECCC
2011
203views ECommerce» more  ECCC 2011»
12 years 11 months ago
Accelerated Slide- and LLL-Reduction
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Claus-Peter Schnorr
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
14 years 2 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer