Sciweavers

518 search results - page 30 / 104
» Beating a Random Assignment
Sort
View
ICPR
2008
IEEE
15 years 8 months ago
Face super-resolution using 8-connected Markov Random Fields with embedded prior
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
Kai Guo, Xiaokang Yang, Rui Zhang, Guangtao Zhai, ...
SAT
2005
Springer
104views Hardware» more  SAT 2005»
15 years 8 months ago
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
Marijn Heule, Hans van Maaren
IPPS
1999
IEEE
15 years 6 months ago
Randomized Initialization Protocols for Packet Radio Networks
The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the i...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
NIPS
2004
15 years 3 months ago
Conditional Random Fields for Object Recognition
We present a discriminative part-based approach for the recognition of object classes from unsegmented cluttered scenes. Objects are modeled as flexible constellations of parts co...
Ariadna Quattoni, Michael Collins, Trevor Darrell
141
Voted
JMLR
2008
159views more  JMLR 2008»
15 years 2 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen