7303 search results - page 421 / 1461 » Optimality for dynamic patterns |
169
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
169
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
183
Voted
IBPRIA
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Piecewise-linear methods accomplish the registration by dividing the images in corresponding triangular patches, which are individually mapped through affine transformati...
161
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
Instruction fetch bandwidth is feared to be a major limiting factor to the performance of future wide-issue aggressive superscalars. In this paper, we focus on Database applicatio...
196
Voted
ISSS
1999
IEEE
15 years 11 months ago
1999
IEEE
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...