Sciweavers

2254 search results - page 127 / 451
» Computing the minimal covering set
Sort
View
103
Voted
NMR
2004
Springer
15 years 6 months ago
Frame consistency: computing with causal explanations
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
Andrea Bracciali, Antonis C. Kakas
CVPR
2008
IEEE
16 years 2 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
94
Voted
SC
2005
ACM
15 years 6 months ago
A Power-Aware Run-Time System for High-Performance Computing
For decades, the high-performance computing (HPC) community has focused on performance, where performance is defined as speed. To achieve better performance per compute node, mic...
Chung-Hsing Hsu, Wu-chun Feng
FCCM
2000
IEEE
144views VLSI» more  FCCM 2000»
15 years 5 months ago
Automatic Synthesis of Data Storage and Control Structures for FPGA-Based Computing Engines
Mapping computations written in high-level programming languages to FPGA-based computing engines requires programmers to generate the datapath responsible for the core of the comp...
Pedro C. Diniz, Joonseok Park
FC
2006
Springer
108views Cryptology» more  FC 2006»
15 years 4 months ago
Uncheatable Reputation for Distributed Computation Markets
Reputation systems aggregate mutual feedback of interacting peers into a "reputation" metric for each participant. This is then available to prospective service "req...
Bogdan Carbunar, Radu Sion