Sciweavers

150 search results - page 15 / 30
» Fast Unimodular Counting
Sort
View
DISOPT
2007
155views more  DISOPT 2007»
13 years 7 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
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...
Alexander D. Scott, Gregory B. Sorkin
ICASSP
2008
IEEE
14 years 2 months ago
Automatic Flamingo detection using a multiple birth and death process
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...
Stig Descamps, Xavier Descombes, Arnaud Bechet, Jo...
ARCS
2006
Springer
13 years 11 months ago
Efficient System-on-Chip Energy Management with a Segmented Bloom Filter
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...
Mrinmoy Ghosh, Emre Özer, Stuart Biles, Hsien...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 2 months ago
Generating and Searching Families of FFT Algorithms
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...
Steve Haynal, Heidi Haynal
GD
2007
Springer
14 years 1 months ago
Drawing Graphs with GLEE
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 ...
Lev Nachmanson, George G. Robertson, Bongshin Lee