Sciweavers

14165 search results - page 45 / 2833
» The generalized two-server problem
Sort
View
ECCC
2011
282views ECommerce» more  ECCC 2011»
14 years 8 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
130
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 8 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
JSS
2011
150views more  JSS 2011»
14 years 8 months ago
A novel general framework for automatic and cost-effective handling of recoverable temporal violations in scientific workflow sy
Due to the complex nature of scientific workflow environments, temporal violations often take place and may severely reduce the timeliness of the execution’s results. To handle ...
Xiao Liu, Zhiwei Ni, Zhangjun Wu, Dong Yuan, Jinju...
ICDE
2012
IEEE
228views Database» more  ICDE 2012»
13 years 4 months ago
A General Method for Estimating Correlated Aggregates over a Data Stream
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
Srikanta Tirthapura, David P. Woodruff
DAM
2011
14 years 9 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz