1291 search results - page 226 / 259 » Computing the multiplicity structure in solving polynomial s... |
154
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
134
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
117
click to vote
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Long design cycles due to the inability to predict silicon realities is a well-known problem that plagues analog/RF integrated circuit product development. As this problem worsens...
106
click to vote
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
135
click to vote
CGO
2011
IEEE
14 years 5 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...