1688 search results - page 29 / 338 » The Complexity of Rationalizing Matchings |
IEAAIE
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a methodology to automate natural language requirements analysis and class model generation based on the Rational Unified Process (RUP). Use-case language schem...
COLT
1992
Springer
13 years 11 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
CTRSA
2007
Springer
13 years 11 months ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper presents a new method for extracting orthogonal bases from AM-FM signals. Since AM-FM signals are non-stationary, appropriate basis functions are sought provided that i...
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...