2127 search results - page 272 / 426 » Computing large matchings fast |
126
click to vote
WSC
2004
15 years 5 months ago
2004
We develop a hierarchical distributed production planning and control methodology, called DISCS, for a large and unstable semiconductor manufacturing process. The upper layer of D...
139
click to vote
VISSYM
2003
15 years 5 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
161
click to vote
APDC
1997
15 years 5 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
113
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we present a novel intrusion detection architecture based on Idiotypic Network Theory (INIDS), that aims at dealing with large scale network attacks featuring variab...
137
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...