Sciweavers

1646 search results - page 276 / 330
» fast 2007
Sort
View
CSDA
2007
102views more  CSDA 2007»
13 years 8 months ago
Smooth functions and local extreme values
Given a sample of n observations y1, . . . , yn at time points t1, . . . , tn we consider the problem of specifying a function ˜f such that ˜f • is smooth, • fits the data ...
A. Kovac
DC
2007
13 years 8 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
DKE
2007
105views more  DKE 2007»
13 years 8 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
DSP
2007
13 years 8 months ago
Performance comparison between statistical-based and direct data domain STAPs
In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training d...
Santana Burintramart, Tapan K. Sarkar, Yu Zhang, M...
EOR
2007
73views more  EOR 2007»
13 years 8 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...