578 search results - page 71 / 116 » The Minimum-Entropy Set Cover Problem |
WADS
1997
Springer
14 years 1 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
DAC
1995
ACM
14 years 13 days ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...