Sciweavers

2344 search results - page 450 / 469
» Generating from a Deep Structure
Sort
View
185
Voted
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 11 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 8 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
86
Voted
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
15 years 7 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu
64
Voted
HRI
2010
ACM
15 years 5 months ago
Validating interaction patterns in HRI
— In recent work, “interaction patterns” have been proposed as a means to characterize essential features of humanrobot interaction. A problem arises, however, in knowing whe...
Peter H. Kahn Jr., Brian T. Gill, Aimee L. Reicher...
92
Voted
SI3D
2010
ACM
15 years 5 months ago
Fast capacity constrained Voronoi tessellation
Lloyd relaxation is widely employed to generate point distribution for a variety of applications in computer graphics, computer vision, and image processing. However, Lloyd relaxa...
Hongwei Li, Diego Nehab, Li-Yi Weiy, Pedro V. Sand...