4926 search results - page 721 / 986 » Two Graph Algorithms On an Associative Computing Model |
DSN
2004
IEEE
14 years 19 hour ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
CASES
2006
ACM
14 years 2 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
CEC
2011
IEEE
12 years 8 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
MM
2005
ACM
14 years 1 months ago
2005
ACM
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...