Sciweavers

2436 search results - page 121 / 488
» Comonadic Notions of Computation
Sort
View
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 11 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
PODS
2012
ACM
244views Database» more  PODS 2012»
13 years 6 months ago
A rigorous and customizable framework for privacy
In this paper we introduce a new and general privacy framework called Pufferfish. The Pufferfish framework can be used to create new privacy definitions that are customized t...
Daniel Kifer, Ashwin Machanavajjhala
186
Voted
TOCL
2012
235views Formal Methods» more  TOCL 2012»
13 years 6 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
ICSE
2012
IEEE-ACM
13 years 6 months ago
Detecting similar software applications
—Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Detecting similar applications is a notoriou...
Collin McMillan, Mark Grechanik, Denys Poshyvanyk
CHI
2002
ACM
16 years 4 months ago
Will it be upper-case or will it be lower-case: can a prompt for text be a mode signal?
The new forms of interaction being devised for small mobile devices have required designers to re-visit basic principles for user interface design. One of these is the notion of m...
Hokyoung Ryu