Sciweavers

169 search results - page 22 / 34
» Efficient search space exploration for HW-SW partitioning
Sort
View
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 3 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
130
Voted
WWW
2009
ACM
15 years 8 months ago
Social search and discovery using a unified approach
: This talk describes a research project exploring new ways for augmenting search using multiple types and sources of social information. Our goal is to allow searching for all obj...
Einat Amitay, David Carmel, Nadav Har'El, Shila Of...
CIKM
2008
Springer
15 years 3 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
IFIP
2001
Springer
15 years 6 months ago
An Evolutionary Approach for Pareto-optimal Configurations in SOC Platforms
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
CVPR
2006
IEEE
16 years 3 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman