Sciweavers

2370 search results - page 126 / 474
» A Structured Set of Higher-Order Problems
Sort
View
116
Voted
GROUP
1999
ACM
15 years 7 months ago
Building bridges: customisation and mutual intelligibility in shared category management
Research into collaborative document use often concentrates on how people share document content. However, studies of real-world document practices reveal that the structures by w...
Paul Dourish, John Lamping, Tom Rodden
105
Voted
CIKM
2010
Springer
15 years 2 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
15 years 9 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
114
Voted
JCDCG
2004
Springer
15 years 8 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
BMCBI
2004
133views more  BMCBI 2004»
15 years 3 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy