Sciweavers

10997 search results - page 2147 / 2200
» On the Structure of Complete Sets
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
NDQA
2003
156views Education» more  NDQA 2003»
13 years 9 months ago
Toward a Question Answering Roadmap
Growth in government investment, academic research, and commercial question answering (QA) systems is motivating a need for increased planning and coordination. The internationali...
Mark T. Maybury
AAAI
2000
13 years 9 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
SERP
2003
13 years 9 months ago
A Maturity Model for the Implementation of Software Process Improvement
Different advances have been made in the development of software process improvement (SPI) standards and models, e.g. capability maturity model (CMM), more recently CMMI, and ISO...
Mahmood Niazi, David Wilson
PAKM
1998
13 years 9 months ago
Knowledge Management: A Text Mining Approach
Knowledge Discovery in Databases (KDD), also known as data mining, focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns wi...
Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan A...
« Prev « First page 2147 / 2200 Last » Next »