6155 search results - page 890 / 1231 » A language for multiple models of computation |
177
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
166
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
198
click to vote
SGP
2007
15 years 9 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
156
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
183
Voted
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— Although AdaBoost has achieved great success, it still suffers from following problems: (1) the training process could be unmanageable when the number of features is extremely ...