Sciweavers

204 search results - page 19 / 41
» Testing Triangle-Freeness in General Graphs
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
ATAL
2005
Springer
14 years 1 months ago
Efficient information retrieval using mobile agents
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
Irene Sygkouna, Miltiades E. Anagnostou
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
WWW
2010
ACM
14 years 26 days ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
12 years 10 months ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...