Sciweavers

849 search results - page 96 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 3 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ICC
2008
IEEE
114views Communications» more  ICC 2008»
14 years 3 months ago
Optimal Statistical Tuning of the RED Parameters
Abstract— Achieving minimal loss while satisfying an acceptable delay profile remains to be an open problem under the RED queuing discipline. In this paper, we present a framewo...
Homayoun Yousefi'zadeh, Amir Habibi, Hamid Jafarkh...
DAGM
2007
Springer
14 years 3 months ago
Curvature Guided Level Set Registration Using Adaptive Finite Elements
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
Andreas Dedner, Marcel Lüthi, Thomas Albrecht...
WAIM
2007
Springer
14 years 3 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
AAAI
2004
13 years 10 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...