Sciweavers

2563 search results - page 438 / 513
» Phenomenology, Representations and Complexity
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 5 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
PODS
2007
ACM
109views Database» more  PODS 2007»
16 years 16 hour ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 16 hour ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
ICSE
2003
IEEE-ACM
15 years 12 months ago
ViewPoints: meaningful relationships are difficult!
The development of complex systems invariably involves many stakeholders who have different perspectives on the problem they are addressing, the system being developed, and the pr...
Bashar Nuseibeh, Jeff Kramer, Anthony Finkelstein
SEMWEB
2009
Springer
15 years 6 months ago
A Database Backend for OWL
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...
Jörg Henss, Joachim Kleb, Stephan Grimm