Amanote Research

Amanote Research

    RegisterSign In

Efficient Multi-Structure Robust Fitting With Incremental Top-K Lists Comparison

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-19282-1_44
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2011

Authors
Hoi Sim WongTat-Jun ChinJin YuDavid Suter
Publisher

Springer Berlin Heidelberg


Related search

Efficient and Self-Tuning Incremental Query Expansion for Top-K Query Processing

2005English

Automatic Extraction of Top-K Lists From Web

IARJSET
2017English

Efficient and Robust Fitting of Lognormal Distributions

North American Actuarial Journal
UncertaintyEconomicsStatisticsEconometricsProbability
2002English

An Efficient Incremental Architecture for Robust Interpretation

2002English

Space-Efficient Top-K Document Retrieval

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

Space-Efficient Framework for Top-K String Retrieval Problems

2009English

Continuous Multi-Dimensional Top-K Query Processing in Sensor Networks

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy