Sciweavers

4114 search results - page 817 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
SIROCCO
2008
13 years 8 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
DMIN
2006
111views Data Mining» more  DMIN 2006»
13 years 8 months ago
Profiling and Clustering Internet Hosts
Identifying groups of Internet hosts with a similar behavior is very useful for many applications of Internet security control, such as DDoS defense, worm and virus detection, dete...
Songjie Wei, Jelena Mirkovic, Ezra Kissel
AAAI
1994
13 years 8 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
USENIX
1994
13 years 8 months ago
Key Management in an Encrypting File System
As distributed computing systems grow in size, complexity and variety of application, the problem of protecting sensitive data from unauthorized disclosure and tampering becomes i...
Matt Blaze
3DOR
2009
13 years 7 months ago
A 3D Shape Benchmark for Retrieval and Automatic Classification of Architectural Data
When drafting new buildings, architects make intensive use of existing 3D models including building elements, furnishing, and environment elements. These models are either directl...
Raoul Wessel, Ina Blümel, Reinhard Klein