Sciweavers

807 search results - page 161 / 162
» Competition Adds Complexity
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
TEC
2012
197views Formal Methods» more  TEC 2012»
11 years 8 months ago
Improving Generalization Performance in Co-Evolutionary Learning
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
Siang Yew Chong, Peter Tino, Day Chyi Ku, Xin Yao
BIOINFORMATICS
2012
11 years 8 months ago
Epigenetic priors for identifying active transcription factor binding sites
Motivation Accurate knowledge of the genome-wide binding of transcription factors in a particular cell type or under a particular condition is necessary for understanding transcri...
Gabriel Cuellar-Partida, Fabian A. Buske, Robert C...
OSDI
2004
ACM
14 years 6 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
ISPA
2005
Springer
13 years 11 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang