Sciweavers

342 search results - page 54 / 69
» Higher order learning with graphs
Sort
View
JSAT
2006
134views more  JSAT 2006»
13 years 7 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
TCOM
2010
159views more  TCOM 2010»
13 years 5 months ago
Evolutionary cooperative spectrum sensing game: how to collaborate?
—Cooperative spectrum sensing has been shown to be able to greatly improve the sensing performance in cognitive radio networks. However, if cognitive users belong to different se...
Beibei Wang, K. J. Ray Liu, T. Charles Clancy
CVPR
2011
IEEE
13 years 3 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
EDBT
2011
ACM
254views Database» more  EDBT 2011»
12 years 11 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...