134
click to vote
HICSS
2012
IEEE
14 years 11 days ago
2012
IEEE
The success of open government initiatives depends on understanding the informational needs of the concerned citizens and other stakeholders as prerequisite for open access to rel...
259
click to vote
HAIS
2012
Springer
14 years 11 days ago
2012
Springer
In this paper we propose a method using a generalization of the weighted majority voting scheme to locate the optic disc (OD) in retinal images automatically. The location with the...
191
click to vote
GC
2012
Springer
14 years 11 days ago
2012
Springer
A cut [X, V − X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V − X. Let sr(n) denote the minimum total size of any cover of the edges of the ...
169
click to vote
FPGA
2012
ACM
14 years 11 days ago
2012
ACM
In floating-point datapaths synthesized on FPGAs, the shifters that perform mantissa alignment and normalization consume a disproportionate number of LUTs. Shifters are implemente...
151
Voted
FPGA
2012
ACM
14 years 11 days ago
2012
ACM
Memory bandwidth is critical to achieving high performance in many FPGA applications. The bandwidth of SDRAM memories is, however, highly dependent upon the order in which address...
175
click to vote
FOSSACS
2012
Springer
14 years 11 days ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
149
Voted
FOSSACS
2012
Springer
14 years 11 days ago
2012
Springer
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
161
click to vote
FOSSACS
2012
Springer
14 years 11 days ago
2012
Springer
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calcu...
141
click to vote
FOSSACS
2012
Springer
14 years 11 days ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...