10718 search results - page 701 / 2144 » On the Circuit Implementation Problem |
256
click to vote
TSP
2010
15 years 2 months ago
2010
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
264
click to vote
PEPM
2011
ACM
14 years 10 months ago
2011
ACM
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
193
click to vote
ECCV
1998
Springer
16 years 9 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
191
click to vote
CCS
2007
ACM
16 years 1 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
237
click to vote
ATAL
2001
Springer
16 years 6 hour ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...