Sciweavers

2150 search results - page 67 / 430
» On a restricted cross-intersection problem
Sort
View
IWPEC
2010
Springer
15 years 2 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
ACSC
2007
IEEE
15 years 10 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
PVLDB
2008
174views more  PVLDB 2008»
15 years 3 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
PAKDD
2004
ACM
121views Data Mining» more  PAKDD 2004»
15 years 9 months ago
Secure Association Rule Sharing
Abstract. The sharing of association rules is often beneficial in industry, but requires privacy safeguards. One may decide to disclose only part of the knowledge and conceal stra...
Stanley R. M. Oliveira, Osmar R. Zaïane, Y&uu...
MICAI
2004
Springer
15 years 9 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan