Sciweavers

17329 search results - page 99 / 3466
» Improved non-approximability results
Sort
View
ICIAR
2004
Springer
14 years 2 months ago
Improving the Boosted Correlogram
Abstract. Introduced seven years ago, the correlogram is a simple statistical image descriptor that nevertheless performs strongly on image retrieval tasks. As a result it has foun...
Nicholas R. Howe, Amanda Ricketson
LREC
2008
153views Education» more  LREC 2008»
13 years 10 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson
IROS
2006
IEEE
115views Robotics» more  IROS 2006»
14 years 2 months ago
Improving Sequential Single-Item Auctions
— We study how to improve sequential single-item auctions that assign targets to robots for exploration tasks such as environmental clean-up, space-exploration, and search and re...
Xiaoming Zheng, Sven Koenig, Craig A. Tovey
CHES
2003
Springer
146views Cryptology» more  CHES 2003»
14 years 14 days ago
Efficient Implementation of Rijndael Encryption in Reconfigurable Hardware: Improvements and Design Tradeoffs
Abstract. Performance evaluation of the Advanced Encryption Standard candidates has led to intensive study of both hardware and software implementations. However, although plentifu...
François-Xavier Standaert, Gaël Rouvro...
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
14 years 3 months ago
Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models
Abstract. Computational inference of transcriptional regulatory networks remains a challenging problem, in part due to the lack of strong network models. In this paper we present e...
Xiuwei Zhang, Bernard M. E. Moret