Sciweavers

3663 search results - page 129 / 733
» Problems in the ontology of computer programs
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
ICALP
2010
Springer
14 years 12 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SEMWEB
2007
Springer
15 years 4 months ago
Analyzing Mapping Extraction Approaches
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
Christian Meilicke, Heiner Stuckenschmidt
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 4 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
IEEEPACT
1998
IEEE
15 years 2 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...