Sciweavers

562 search results - page 63 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
ACL
2009
14 years 7 months ago
Efficient Inference of CRFs for Large-Scale Natural Language Data
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
Minwoo Jeong, Chin-Yew Lin, Gary Geunbae Lee
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
15 years 10 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
ICPR
2000
IEEE
15 years 10 months ago
Self-Calibration of a Stereo Rig in a Planar Scene by Data Combination
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
Joss Knight, Ian D. Reid
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
15 years 1 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
ECCV
2010
Springer
15 years 1 months ago
Bundle Adjustment in the Large
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...