Sciweavers

1920 search results - page 63 / 384
» The Complexity of the A B C Problem
Sort
View
COMPGEOM
2010
ACM
15 years 10 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
CRYPTO
2005
Springer
106views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
Omer Barkol, Yuval Ishai
AAAI
2007
15 years 8 months ago
Representing and Reasoning about Commitments in Business Processes
A variety of business relationships in open settings can be understood in terms of the creation and manipulation of commitments among the participants. These include B2C and B2B c...
Nirmit Desai, Amit K. Chopra, Munindar P. Singh
DEXAW
2002
IEEE
148views Database» more  DEXAW 2002»
15 years 11 months ago
A Practical Approach to Multi-Attribute Auctions
In most electronic auctions conducted over the Internet today price is still the only decision criteria for the best bid. This is true for all sorts of auctions in the electronic ...
Birgit Burmeister, Tobias Ihde, Thomas Kittsteiner...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...