Sciweavers

1568 search results - page 177 / 314
» The problem of examination questions in algorithmics
Sort
View
LATIN
2004
Springer
15 years 11 months ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
ENGL
2006
157views more  ENGL 2006»
15 years 6 months ago
Dealing with Acronyms in Biomedical Texts
Recently, there has been a growth in the amount of machine readable information pertaining to the biomedical field. With this growth comes a desire to be able to extract informati...
David B. Bracewell, Fuji Ren, Shingo Kuroiwa
CIKM
2009
Springer
16 years 29 days ago
Effective and efficient structured retrieval
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
Le Zhao, Jamie Callan
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 6 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 6 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao