Sciweavers

306 search results - page 28 / 62
» Constructive analysis, types and exact real numbers
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 6 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Recurrence relations and fast algorithms
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
Mark Tygert
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 7 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
ASUNAM
2011
IEEE
12 years 7 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos
JUCS
2002
79views more  JUCS 2002»
13 years 7 months ago
Some Notes on Fine Computability
: A metric defined by Fine induces a topology on the unit interval which is strictly stronger than the ordinary Euclidean topology and which has some interesting applications in Wa...
Vasco Brattka