Sciweavers

1066 search results - page 163 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
COR
2011
14 years 4 months ago
A Lagrangian heuristic for satellite range scheduling with resource constraints
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Ro...
ICDCS
2006
IEEE
15 years 3 months ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 2 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
14 years 9 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo