8499 search results - page 398 / 1700 » networking 2007 |
208
Voted
COLOGNETWENTE
2007
15 years 8 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
181
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Ad hoc networks have gained place in the research area recently. There are many researches regarding different topics related to such networks, such as routing, media access co...
183
Voted
SGAI
2007
Springer
16 years 29 days ago
2007
Springer
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
185
click to vote
NETWORKS
2007
15 years 6 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
179
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— Rapidly evolving businesses generate massive amounts of time-stamped data sequences and defy a demand for massively multivariate time series analysis. For such data the predict...