1688 search results - page 28 / 338 » The Complexity of Rationalizing Matchings |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
DILS
2010
Springer
13 years 8 months ago
2010
Springer
Matching life science ontologies to determine ontology mappings has recently become an active field of research. The large size of existing ontologies and the application of comple...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
MKWI
2008
13 years 9 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...