Sciweavers

4378 search results - page 113 / 876
» On the Complexity of Ordered Colourings
Sort
View
FOCS
2002
IEEE
14 years 3 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
ICECCS
2000
IEEE
105views Hardware» more  ICECCS 2000»
14 years 2 months ago
Distributed Development of Complex Software Systems with Object Make
Production of a large-scale software system involves quite a few software components. It is very common to develop such software components in a distributed environment consisting...
Yasuhiro Sugiyama
ISCAS
1999
IEEE
100views Hardware» more  ISCAS 1999»
14 years 2 months ago
Reduced complexity, high performance digital delta-sigma modulator for fractional-N frequency synthesis
This paper presents the design consideration of high order digital AZ modulators used as modulus controller for fractional-N frequency synthesizer. A third-order MASH structure (M...
Lizhong Sun, Thierry Lepley, Franck Nozahic, Amaud...
CEAS
2004
Springer
14 years 1 months ago
Managing Customer Opt-Outs in a Complex Global Environment
The day to day rhetoric associated with spam control focuses on measures, technology, rules or fees to impose order or control. These efforts concentrate on the broad range of mess...
Matt Leonard, Mayra Rodriguez, Richard Segal, Robe...
DIAGRAMS
2006
Springer
14 years 1 months ago
Topological Relations of Arrow Symbols in Complex Diagrams
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...
Yohei Kurata, Max J. Egenhofer