Sciweavers

730 search results - page 106 / 146
» Combinatorics of Monotone Computations
Sort
View
ICDCS
2002
IEEE
14 years 17 days ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao
GD
2009
Springer
14 years 7 days ago
Manhattan-Geodesic Embedding of Planar Graphs
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander...
ECAI
2000
Springer
13 years 12 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
ICVS
1999
Springer
13 years 12 months ago
Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
Tony Jebara, Alex Pentland
STACS
1999
Springer
13 years 12 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann