1469 search results - page 230 / 294 » Approximate polynomial decomposition |
195
Voted
COMGEO
2012
ACM
14 years 26 days ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
151
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
151
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
170
click to vote
IJON
2007
15 years 5 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...