Sciweavers

248 search results - page 26 / 50
» The Relative Complexity of NP Search Problems
Sort
View
FASE
2009
Springer
14 years 2 months ago
SNIFF: A Search Engine for Java Using Free-Form Queries
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...
Shaunak Chatterjee, Sudeep Juvekar, Koushik Sen
AWIC
2003
Springer
14 years 28 days ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh
BMCBI
2010
140views more  BMCBI 2010»
13 years 5 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
IJCAI
2003
13 years 9 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
NPC
2010
Springer
13 years 6 months ago
Exposing Tunable Parameters in Multi-threaded Numerical Code
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
Apan Qasem, Jichi Guo, Faizur Rahman, Qing Yi