Sciweavers

597 search results - page 65 / 120
» Open problems in data collection networks
Sort
View
SPAA
2009
ACM
14 years 5 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ICDM2
2004
Springer
196views Data Mining» more  ICDM2 2004»
14 years 1 months ago
An Early Warning System for Vehicle Related Quality Data
Vehicle production audit tests, warranty claims and car control unit data are stored in a central data warehouse for data mining analysis. Neural network based part failure rate es...
Matthias Grabert, Markus Prechtel, Tomas Hrycej, W...
GLOBECOM
2007
IEEE
13 years 11 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
13 years 11 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...
TKDE
2012
229views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Effective Pattern Discovery for Text Mining
—Many data mining techniques have been proposed for mining useful patterns in text documents. However, how to effectively use and update discovered patterns is still an open rese...
Ning Zhong, Yuefeng Li, Sheng-Tang Wu