Sciweavers

876 search results - page 26 / 176
» New Results for the Martin Polynomial
Sort
View
SMC
2007
IEEE
103views Control Systems» more  SMC 2007»
14 years 2 months ago
A new evaluation measure for information retrieval systems
Abstract— Some of the established approaches to evaluating text clustering algorithms for information retrieval show theoretical flaws. In this paper, we analyze these flaws an...
Martin Mehlitz, Christian Bauckhage, Jér&oc...
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 8 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
HEURISTICS
2007
165views more  HEURISTICS 2007»
13 years 8 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
IR
2000
13 years 8 months ago
New Approaches to Spoken Document Retrieval
This paper presents four novel techniques for open-vocabulary spoken document retrieval: a method to detect slots that possibly contain a query feature; a method to estimate occurr...
Martin Wechsler, Eugen Munteanu, Peter Schäub...
ICALP
2011
Springer
13 years 3 days ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge