16188 search results - page 2722 / 3238 » The Optimal PAC Algorithm |
201
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
170
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them ...
181
click to vote
SIGCOMM
1999
ACM
15 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
195
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
234
click to vote
GI
1998
Springer
15 years 11 months ago
1998
Springer
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...