Sciweavers

4095 search results - page 704 / 819
» How to test a tree
Sort
View
ECCC
2007
144views more  ECCC 2007»
13 years 8 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
ENTCS
2007
126views more  ENTCS 2007»
13 years 8 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
JSAC
2006
120views more  JSAC 2006»
13 years 8 months ago
Multiple-Source Internet Tomography
Abstract-- Information about the topology and link-level characteristics of a network is critical for many applications including network diagnostics and management. However, this ...
Michael Rabbat, Mark Coates, Robert D. Nowak
ML
2008
ACM
13 years 8 months ago
Discovering significant patterns
Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...
Geoffrey I. Webb
JSS
2006
62views more  JSS 2006»
13 years 8 months ago
A method for defining IEEE Std 1471 viewpoints
With the growing impact of information technology the proper understanding of IT-architecture designs is becoming ever more important. Much debate has been going on about how to d...
Henk Koning, Hans van Vliet