Sciweavers

2475 search results - page 378 / 495
» Question Answering in TREC
Sort
View
163
Voted
ICALP
2010
Springer
15 years 8 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CIKM
2008
Springer
15 years 8 months ago
A generative retrieval model for structured documents
Structured documents contain elements defined by the author(s) and annotations assigned by other people or processes. Structured documents pose challenges for probabilistic retrie...
Le Zhao, Jamie Callan
APN
2005
Springer
15 years 8 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
15 years 8 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
COLT
2008
Springer
15 years 8 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman