Sciweavers

1363 search results - page 271 / 273
» The road coloring problem
Sort
View
125
Voted
JAIR
2007
132views more  JAIR 2007»
15 years 1 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
Chu Min Li, Felip Manyà, Jordi Planes
124
Voted
NN
2000
Springer
152views Neural Networks» more  NN 2000»
15 years 26 days ago
A neural network theory of proportional analogy-making
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
Nilendu G. Jani, Daniel S. Levine
126
Voted
COMCOM
1998
83views more  COMCOM 1998»
15 years 23 days ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
121
Voted
VLSISP
2002
112views more  VLSISP 2002»
15 years 21 days ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
120
Voted
PAMI
2007
127views more  PAMI 2007»
15 years 17 days ago
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang