796 search results - page 42 / 160 » The Anonymous Subgraph Problem |
82
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
To receive personalized web services, the user has to provide personal information and preferences, in addition to the query itself, to the web service. However, detailed personal...
137
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
113
Voted
TON
2012
13 years 3 months ago
2012
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
100
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
ASPDAC
2004
ACM
15 years 4 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...