Sciweavers

152 search results - page 25 / 31
» An Experimental Study of Random Knapsack Problems
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 28 days ago
Takeover times on scale-free topologies
The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of inter-individual interactions affects th...
Joshua L. Payne, Margaret J. Eppstein
CVPR
2010
IEEE
14 years 12 days ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
WINET
2002
163views more  WINET 2002»
13 years 6 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...
TC
2010
13 years 5 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
AAAI
2006
13 years 8 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman