Sciweavers

594 search results - page 60 / 119
» Using Approximation to Relate Computational Classes over the...
Sort
View
NIPS
2007
13 years 10 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer
CIKM
2004
Springer
14 years 2 months ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...
SOFSEM
2010
Springer
13 years 6 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
IACR
2011
146views more  IACR 2011»
12 years 8 months ago
Identity-based Digital Signature Scheme Without Bilinear Pairings
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
Debiao He, Jianhua Chen, Jin Hu
JUCS
2010
109views more  JUCS 2010»
13 years 3 months ago
Semantics of Query-Driven Communication of Exact Values
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
Michal Konecný, Amin Farjudian