Sciweavers

843 search results - page 152 / 169
» A Graph-cut Based Algorithm For Approximate Mrf Optimization
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
14 years 23 days ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
ICA
2010
Springer
13 years 8 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin