1046 search results - page 146 / 210 » Approximation Algorithms for Domination Search |
133
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
151
click to vote
SODA
2010
ACM
16 years 20 days ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
160
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic p...
143
click to vote
SIGMOD
2003
ACM
16 years 3 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
106
click to vote
CIKM
2009
Springer
2009
Springer
Improving retrievability of patents with cluster-based pseudo-relevance feedback documents selection
15 years 9 months ago
High findability of documents within a certain cut-off rank is considered an important factor in recall-oriented application domains such as patent or legal document retrieval. ...