Sciweavers

1399 search results - page 190 / 280
» Multi-party Finite Computations
Sort
View
133
Voted
TCS
2008
15 years 4 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
120
Voted
ACS
2004
15 years 4 months ago
A Categorical Approach to Threshold Agent Networks
Threshold agent networks (TANs) constitute a discretized modification of threshold (also known as neural) networks that are appropriate for modeling computer simulations. In this p...
George Voutsadakis
CPHYSICS
2004
92views more  CPHYSICS 2004»
15 years 4 months ago
Ultrahigh resolution simulations of mode converted ion cyclotron waves and lower hybrid waves
Full Wave studies of mode conversion (MC) processes in toroidal plasmas have required prohibitive amount of computer resources in the past because of the disparate spatial scales ...
J. C. Wright, P. T. Bonoli, E. D'Azevedo, M. Bramb...
CC
2002
Springer
126views System Software» more  CC 2002»
15 years 4 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof
COLING
2002
15 years 4 months ago
(Semi-)Automatic Detection of Errors in PoS-Tagged Corpora
This paper presents a simple yet in practice very efficient technique serving for automatic detection of those positions in a partof-speech tagged corpus where an error is to be s...
Pavel Kveton, Karel Oliva