Sciweavers

4908 search results - page 713 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CGO
2008
IEEE
15 years 8 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
FM
2008
Springer
152views Formal Methods» more  FM 2008»
15 years 8 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
DAIS
2006
15 years 8 months ago
PAGE: A Distributed Infrastructure for Fostering RDF-Based Interoperability
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
Emanuele Della Valle, Andrea Turati, Alessandro Gh...
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 7 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 7 months ago
Emergent architecture in self organized swarm systems for military applications
Many sectors of the military are interested in Self-Organized (SO) systems because of their flexibility, versatility and economics. The military is researching and employing auto...
Dustin J. Nowak, Gary B. Lamont, Gilbert L. Peters...