Sciweavers

27827 search results - page 5052 / 5566
» Generating
Sort
View
CIKM
2005
Springer
15 years 10 months ago
Automatic construction of multifaceted browsing interfaces
Databases of text and text-annotated data constitute a significant fraction of the information available in electronic form. Searching and browsing are the typical ways that users...
Wisam Dakka, Panagiotis G. Ipeirotis, Kenneth R. W...
CIKM
2005
Springer
15 years 10 months ago
A function-based access control model for XML databases
XML documents are frequently used in applications such as business transactions and medical records involving sensitive information. Typically, parts of documents should be visibl...
Naizhen Qi, Michiharu Kudo, Jussi Myllymaki, Hamid...
CIKM
2005
Springer
15 years 10 months ago
Person resolution in person search results: WebHawk
Finding information about people on the Web using a search engine is difficult because there is a many-to-many mapping between person names and specific persons (i.e. referents). ...
Xiaojun Wan, Jianfeng Gao, Mu Li, Binggong Ding
CLEF
2005
Springer
15 years 10 months ago
CLEF 2005: Multilingual Retrieval by Combining Multiple Multilingual Ranked Lists
: We participated in two tasks: Multi-8 two-years-on retrieval and Multi-8 results merging. For our multi-8 two-years-on retrieval work, simple multilingual ranked lists are first ...
Luo Si, Jamie Callan
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 10 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 5052 / 5566 Last » Next »