Sciweavers

1842 search results - page 134 / 369
» Measurement theory in linguistics
Sort
View
SIGIR
2005
ACM
15 years 6 months ago
Measure-based metasearch
We propose a simple method for converting many standard measures of retrieval performance into metasearch algorithms. Our focus is both on the analysis of retrieval measures thems...
Javed A. Aslam, Virgiliu Pavlu, Emine Yilmaz
POLICY
2005
Springer
15 years 6 months ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 1 months ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
JUCS
2008
151views more  JUCS 2008»
15 years 1 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
DAS
2010
Springer
15 years 6 months ago
Analysis of whole-book recognition
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
Pingping Xiu, Henry S. Baird