Sciweavers

2593 search results - page 356 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
FOCS
2006
IEEE
14 years 4 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
SAC
2006
ACM
14 years 4 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
CONCUR
2006
Springer
14 years 1 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
DASC
2006
IEEE
14 years 1 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
14 years 1 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas