Sciweavers

9997 search results - page 416 / 2000
» The case for crowd computing
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 8 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
CAD
1999
Springer
15 years 6 months ago
The intersection of two ruled surfaces
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
Hee-Seok Heo, Myung-Soo Kim, Gershon Elber
CORR
2010
Springer
118views Education» more  CORR 2010»
15 years 3 months ago
Estimating Probabilities in Recommendation Systems
Modeling ranked data is an essential component in a number of important applications including recommendation systems and websearch. In many cases, judges omit preference among un...
Mingxuan Sun, Guy Lebanon, Paul Kidwell
COLING
2010
15 years 1 months ago
An Evaluation Framework for Plagiarism Detection
We present an evaluation framework for plagiarism detection.1 The framework provides performance measures that address the specifics of plagiarism detection, and the PAN-PC-10 cor...
Martin Potthast, Benno Stein, Alberto Barró...
TASLP
2010
148views more  TASLP 2010»
15 years 1 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...