Sciweavers

4581 search results - page 250 / 917
» Computing Transformation Semigroups
Sort
View
186
Voted
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
AAAI
2010
15 years 6 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 6 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
IIE
2007
114views more  IIE 2007»
15 years 6 months ago
Design and Implementation of a Logo-based Computer Graphics Course
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
Pavel Boytchev
WWW
2008
ACM
16 years 7 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen