Sciweavers

38 search results - page 6 / 8
» Easy and Hard Testbeds for Real-Time Search Algorithms
Sort
View
JCDL
2010
ACM
188views Education» more  JCDL 2010»
13 years 11 months ago
Exposing the hidden web for chemical digital libraries
In recent years, the vast amount of digitally available content has lead to the creation of many topic-centered digital libraries. Also in the domain of chemistry more and more di...
Sascha Tönnies, Benjamin Köhncke, Oliver...
AIPS
2009
13 years 7 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
ASIACRYPT
2011
Springer
12 years 5 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
MOBISYS
2008
ACM
14 years 5 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
MIR
2010
ACM
325views Multimedia» more  MIR 2010»
13 years 7 months ago
A classification-driven similarity matching framework for retrieval of biomedical images
This paper presents a classification-driven biomedical image retrieval system to bride the semantic gap by transforming image features to their global categories at different gran...
Md. Mahmudur Rahman, Sameer Antani, George R. Thom...