Sciweavers

2108 search results - page 393 / 422
» Constrained Heuristic Search
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
14 years 9 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
TKDE
2011
330views more  TKDE 2011»
14 years 6 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
CGO
2011
IEEE
14 years 3 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
ICASSP
2011
IEEE
14 years 3 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
CVPR
2004
IEEE
16 years 1 months ago
From Fragments to Salient Closed Boundaries: An In-Depth Study
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
Song Wang, Jun Wang, Toshiro Kubota