Sciweavers

1559 search results - page 68 / 312
» Fundamentals of Generic Programming
Sort
View
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 1 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
CVPR
2006
IEEE
15 years 11 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
INFORMATICALT
2000
114views more  INFORMATICALT 2000»
14 years 9 months ago
The Language-Centric Program Generator Models: 3L Paradigm
Abstract. In this paper we suggest a three-language (3L) paradigm for building the program generator models. The basis of the paradigm is a relationship model of the specification,...
Vytautas Stuikys, Giedrius Ziberkas, Robertas Dama...
MM
2000
ACM
166views Multimedia» more  MM 2000»
15 years 2 months ago
Automatically extracting highlights for TV Baseball programs
In today’s fast-paced world, while the number of channels of television programming available is increasing rapidly, the time available to watch them remains the same or is decr...
Yong Rui, Anoop Gupta, Alex Acero
JFP
2010
82views more  JFP 2010»
14 years 8 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes