Sciweavers

3643 search results - page 575 / 729
» Learning Submodular Functions
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 7 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
SMARTNET
2000
15 years 7 months ago
Towards Dynamic Composition of Hybrid Communication Services
: Due to the deregulation of the telecom network and the Internet, users will have access to an increasing number of heterogeneous communication services and will need to adapt the...
Jacqueline Floch, Rolv Bræk
IJCAI
1993
15 years 7 months ago
Average-Case Analysis of a Nearest Neighbor Algorithm
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
Pat Langley, Wayne Iba
ULPAA
1994
143views Hardware» more  ULPAA 1994»
15 years 7 months ago
Configuring Function-based Communication Protocols for Multimedia Applications
Next generation communication systems must support diverse applications operating over high-performance local, metropolitan, and wide area networks. This paper describes a framewo...
Douglas C. Schmidt, Burkhard Stiller, Tatsuya Suda...
BPM
2010
Springer
186views Business» more  BPM 2010»
15 years 7 months ago
How to Implement a Theory of Correctness in the Area of Business Processes and Services
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...
Niels Lohmann, Karsten Wolf