Sciweavers

7773 search results - page 410 / 1555
» On generalized Frame-Stewart numbers
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
ATAL
2009
Springer
15 years 11 months ago
Dynamic information source selection for intrusion detection systems
Our work presents a mechanism designed for the selection of the optimal information provider in a multi-agent, heterogeneous and unsupervised monitoring system. The selfadaptation...
Martin Rehák, Eugen Staab, Michal Pechoucek...
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
15 years 11 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
175
Voted
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 11 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
INFOCOM
2000
IEEE
15 years 11 months ago
End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-re...
Srisankar S. Kunniyur, Rayadurgam Srikant