Sciweavers

848 search results - page 60 / 170
» Randomness and the linear degrees of computability
Sort
View
FOCS
2005
IEEE
15 years 5 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
CVPR
2010
IEEE
15 years 5 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...
BMCBI
2006
141views more  BMCBI 2006»
14 years 12 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
CIE
2005
Springer
15 years 5 months ago
Schnorr Dimension
Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contr...
Rodney G. Downey, Wolfgang Merkle, Jan Reimann
SC
2000
ACM
15 years 4 months ago
Data Access Performance in a Large and Dynamic Pharmaceutical Drug Candidate Database
An explosion in the amount of data generated through chemical and biological experimentation has been observed in recent years. This rapid proliferation of vast amounts of data ha...
Zina Ben-Miled, Yang Liu, David Powers, Omran A. B...