Sciweavers

159 search results - page 20 / 32
» Open Problems from CCCG 2008
Sort
View
ECCC
2008
122views more  ECCC 2008»
13 years 7 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ECAI
2008
Springer
13 years 9 months ago
Privacy-Preserving Query Answering in Logic-based Information Systems
Abstract. We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other informat...
Bernardo Cuenca Grau, Ian Horrocks
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
13 years 7 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
COMPUTER
2002
196views more  COMPUTER 2002»
13 years 7 months ago
Grid Services for Distributed System Integration
ions and concepts that let applications access and share resources and services across distributed, wide area networks, while providing common security semantics, distributed resou...
Ian T. Foster, Carl Kesselman, Jeffrey M. Nick, St...
EJC
2008
13 years 7 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal