Sciweavers

17770 search results - page 3121 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
15 years 10 months ago
Predicting the product purchase patterns of corporate customers
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
Bhavani Raskutti, Alan Herschtal
140
Voted
KIVS
2005
Springer
15 years 10 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
NOSSDAV
2005
Springer
15 years 10 months ago
MOPAR: a mobile peer-to-peer overlay architecture for interest management of massively multiplayer online games
In this paper we propose a fully distributed peer-to-peer (P2P) infrastructure supporting Networked Virtual Environment (NVE) applications, such as massively multiplayer online ga...
Anthony (Peiqun) Yu, Son T. Vuong
OOPSLA
2005
Springer
15 years 10 months ago
Estimating software based on use case points
It is well documented that software product cost estimates are notoriously inaccurate across the software industry. Creating accurate cost estimates for software product developme...
Edward R. Carroll
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 10 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
« Prev « First page 3121 / 3554 Last » Next »