Sciweavers

6894 search results - page 1350 / 1379
» Generation Problems
Sort
View
CORR
2006
Springer
143views Education» more  CORR 2006»
15 years 1 months ago
A Knowledge-Based Approach for Selecting Information Sources
Through the Internet and the World-Wide Web, a vast number of information sources has become available, which offer information on various subjects by different providers, often i...
Thomas Eiter, Michael Fink, Hans Tompits
DKE
2006
70views more  DKE 2006»
15 years 1 months ago
Merging news reports that describe events
Many kinds of news report provide information about events. For example, business news reports in the area of mergers and acquisitions, provide information about events such as &q...
Anthony Hunter, Rupert Summerton
BMCBI
2007
200views more  BMCBI 2007»
15 years 1 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...
BMCBI
2007
144views more  BMCBI 2007»
15 years 1 months ago
Automatic delineation of malignancy in histopathological head and neck slides
Background: Histopathology, which is one of the most important routines of all laboratory procedures used in pathology, is decisive for the diagnosis of cancer. Experienced histop...
Mutlu Mete, Xiaowei Xu, Chun-Yang Fan, Gal Shafirs...
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 1 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 1350 / 1379 Last » Next »