150 search results - page 15 / 30 » Fast Unimodular Counting |
168
click to vote
DISOPT
2007
15 years 6 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
183
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
Here we present a new approach to automatically detect and count breeding Greater Flamingos (Phoenicopterus Roseus) on aerial photographsof their colonies. We consider a stochasti...
166
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
As applications tend to grow more complex and use more memory, the demand for cache space increases. Thus embedded processors are inclined to use larger caches. Predicting a miss i...
157
click to vote
CORR
2011
Springer
15 years 27 days ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
141
click to vote
GD
2007
Springer
16 years 17 days ago
2007
Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...