Sciweavers

15485 search results - page 30 / 3097
» Computing Optimal Subsets
Sort
View
PODC
2000
ACM
13 years 11 months ago
Efficient generation of all regular non-dominated coteries
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which
Kazuhisa Makino, Tiko Kameda
APLAS
2003
ACM
14 years 24 days ago
Controlling and Optimizing the Usage of One Resource
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...
Antoine Galland, Mathieu Baudet
CVPR
2008
IEEE
14 years 9 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
EUROPAR
2009
Springer
14 years 2 months ago
Impact of Quad-Core Cray XT4 System and Software Stack on Scientific Computation
An upgrade from dual-core to quad-core AMD processor on the Cray XT system at the Oak Ridge National Laboratory (ORNL) Leadership Computing Facility (LCF) has resulted in significa...
Sadaf R. Alam, Richard F. Barrett, Heike Jagode, J...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei