Sciweavers

697 search results - page 46 / 140
» On the Theory of Average Case Complexity
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
ICIP
2005
IEEE
14 years 1 months ago
Using Tsallis entropy into a Bayesian network for CBIR
This paper presents a Bayesian Network model for ContentBased Image Retrieval (CBIR). In the explanation and test of this work, only two images features (semantic evidences) are i...
Paulo S. Rodrigues, Gilson A. Giraldi, Ade A. Arau...
IJAHUC
2006
129views more  IJAHUC 2006»
13 years 7 months ago
Optimal distance geographic routing for energy efficient wireless sensor networks
: Wireless sensor networks require energy efficient routing protocols owing to limited resource on the sensor node. In this paper, we develop optimal distance geographic routing (O...
Xin-Ming Huang, Jing Ma
ICASSP
2011
IEEE
12 years 11 months ago
Cooperative Maximum Likelihood estimation for fluid flow dynamics in biosensor arrays
Abstract—This paper deals with estimation of the concentration of target molecules in a fluid when it flows past multiple biosensors. The fluid flow is modelled as an advecti...
Maryam Abolfath Beygi, Vikram Krishnamurthy
COCOON
1999
Springer
14 years 4 days ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman