Sciweavers

1688 search results - page 284 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 10 months ago
Rule-based Generation of Diff Evolution Mappings between Ontology Versions
Ontologies such as taxonomies, product catalogs or web directories are heavily used and hence evolve frequently to meet new requirements or to better reflect the current instance d...
Michael Hartung, Anika Gross, Erhard Rahm
AES
2006
Springer
106views Cryptology» more  AES 2006»
13 years 10 months ago
A grid-enabled problem solving environment for parallel computational engineering design
This paper describes the development and application of a piece of engineering software that provides a Problem Solving Environment (PSE) capable of launching, and interfacing wit...
C. E. Goodyer, Martin Berzins, Peter K. Jimack, L....
EOR
2008
95views more  EOR 2008»
13 years 10 months ago
Enabling e-transactions with multi-attribute preference models
This paper describes potential applications of multi-attribute preference models (MAPM) in e-commerce and offers some guidelines for their implementation. MAPM are methodologies f...
John C. Butler, James S. Dyer, Jianmin Jia, Kerem ...
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 10 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
ECCC
2006
70views more  ECCC 2006»
13 years 10 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas