Sciweavers

180 search results - page 9 / 36
» ir 2008
Sort
View
ACL
2008
13 years 9 months ago
Decompounding query keywords from compounding languages
Splitting compound words has proved to be useful in areas such as Machine Translation, Speech Recognition or Information Retrieval (IR). Furthermore, real-time IR systems (such as...
Enrique Alfonseca, Slaven Bilac, Stefan Pharies
SIGIR
2008
ACM
13 years 7 months ago
AIR 2006: First International Workshop on Adaptive Information Retrieval
Adaptive Information Retrieval (IR) systems are designed to optimize retrieval effectiveness and user interaction in an underlying search environment. In this article, we report o...
Hideo Joho, Jana Urban, Robert Villa, Joemon M. Jo...
TREC
2004
13 years 9 months ago
UB at TREC 13: Genomics Track
This paper describes the experiments of the State University of New York at Buffalo in TREC 13. We participated in the Genomics track and submitted official runs to the Adhoc retri...
Miguel E. Ruiz, Munirathnam Srikanth, Rohini K. Sr...
IR
2008
13 years 7 months ago
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
Kimmo Fredriksson, Szymon Grabowski
DM
2002
91views more  DM 2002»
13 years 7 months ago
A disproof of Henning's conjecture on irredundance perfect graphs
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
Lutz Volkmann, Vadim E. Zverovich