7006 search results - page 1316 / 1402 » Approximation Algorithms |
111
Voted
ICS
2004
Tsinghua U.
15 years 6 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
88
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
89
Voted
CLUSTER
2008
IEEE
15 years 2 months ago
2008
IEEE
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
121
Voted
EOR
2010
15 years 25 days ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
124
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...