Sciweavers

4095 search results - page 280 / 819
» How to test a tree
Sort
View
96
Voted
LOGCOM
2007
89views more  LOGCOM 2007»
15 years 17 days ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
133
Voted
COMGEO
2000
ACM
15 years 16 days ago
Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
DATAMINE
2002
125views more  DATAMINE 2002»
15 years 15 days ago
High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
William H. Hsu, Michael Welge, Thomas Redman, Davi...
CVPR
2011
IEEE
14 years 8 months ago
Combining Randomization and Discrimination for Fine-Grained Image Categorization
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...
Bangpeng Yao, Aditya Khosla, Li Fei-Fei
115
Voted
SIAMSC
2011
140views more  SIAMSC 2011»
14 years 3 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...