4679 search results - page 125 / 936 » Modeling When Connections Are the Problem |
100
click to vote
NIPS
2001
15 years 3 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
112
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
118
click to vote
IHIS
2005
ACM
15 years 7 months ago
2005
ACM
The goal of this work is to contribute to the field of interoperability of Workflow models. To achieve this interoperability, we have built a generic architecture that s three lev...
119
click to vote
SNPD
2007
15 years 3 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
113
click to vote
ICMCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We present an interactive workspace that integrates wiki collaboration in knowledge-building activities with face-to-face scenarios like brainstorming or problem solving sessions....