Sciweavers

1692 search results - page 130 / 339
» Applying Science Models for Search
Sort
View
SARA
2007
Springer
14 years 3 months ago
Generating Implied Boolean Constraints Via Singleton Consistency
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
Roman Barták
SIGIR
2011
ACM
12 years 11 months ago
The economics in interactive information retrieval
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...
Leif Azzopardi
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 8 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
CVIU
2011
13 years 13 days ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
IR
2010
13 years 7 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...