Sciweavers

167 search results - page 29 / 34
» Comparing Two Notions of Simulatability
Sort
View
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 1 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
DLOG
2011
12 years 11 months ago
Analysing Multiple Versions of an Ontology: A Study of the NCI Thesaurus
The detection of changes between OWL ontologies is an important service for ontology engineering. There are several approaches to this problem, both syntactic and semantic. A purel...
Rafael S. Gonçalves, Bijan Parsia, Ulrike S...
GIS
2005
ACM
14 years 8 months ago
Towards topological consistency and similarity of multiresolution geographical maps
Several application contexts require the ability to use together and compare different geographic datasets (maps) concerning the same or overlapping areas. This is for example the...
Alberto Belussi, Barbara Catania, Paola Podest&agr...
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 2 months ago
Searching by Similarity and Classifying Images on a Very Large Scale
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
Giuseppe Amato, Pasquale Savino
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
14 years 22 hour ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton