Sciweavers

1117 search results - page 59 / 224
» Equivalent Representations of Set Functions
Sort
View
SDM
2004
SIAM
211views Data Mining» more  SDM 2004»
14 years 11 months ago
Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
FOCS
2006
IEEE
15 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
EPEW
2006
Springer
15 years 1 months ago
Explicit Inverse Characterizations of Acyclic MAPs of Second Order
This paper shows how to construct a Markovian arrival process of second order from information on the marginal distribution and on its autocorrelation function. More precisely, clo...
Armin Heindl, Gábor Horváth, Karsten...
IWFM
1998
117views Formal Methods» more  IWFM 1998»
14 years 11 months ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
TVCG
2012
184views Hardware» more  TVCG 2012»
13 years 2 days ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan