Sciweavers

9842 search results - page 1952 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EUROCRYPT
2004
Springer
14 years 27 days ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
FLOPS
2004
Springer
14 years 26 days ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
14 years 26 days ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...
ICSR
2004
Springer
14 years 26 days ago
XML-Based Feature Modelling
This paper describes a feature modelling technique aimed at modelling the software assets behind a product family. The proposed technique is distinctive in five respects. First, it...
Vaclav Cechticky, Alessandro Pasetti, O. Rohlik, W...
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
14 years 26 days ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint
« Prev « First page 1952 / 1969 Last » Next »