Sciweavers

652 search results - page 25 / 131
» fast 2004
Sort
View
AIPS
2004
13 years 9 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
CLA
2004
13 years 9 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Fast mixing for independent sets, colorings and other models on trees
We study the mixing time of the Glauber dynamics for general spin systems on bounded-degree trees, including the Ising model, the hard-core model (independent sets) and the antife...
Fabio Martinelli, Alistair Sinclair, Dror Weitz
USS
2004
13 years 9 months ago
Very Fast Containment of Scanning Worms
Computer worms -- malicious, self-propagating programs -- represent a significant threat to large networks. One possible defense, containment, seeks to limit a worm's spread ...
Nicholas Weaver, Stuart Staniford, Vern Paxson
CGF
2004
89views more  CGF 2004»
13 years 7 months ago
Fast Multipath Radiosity using Hierarchical Subscenes
This paper presents an efficient acceleration technique for the global line radiosity Multipath method. In this approach, the scene is subdivided in a hierarchy of box bounded sub...
Francesc Castro, Mateu Sbert, László...