Sciweavers

77 search results - page 6 / 16
» Fast Evaluation of Union-Intersection Expressions
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
CIKM
1998
Springer
14 years 2 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
FP
1989
124views Formal Methods» more  FP 1989»
14 years 1 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
HPDC
2010
IEEE
13 years 11 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
EDBT
2008
ACM
151views Database» more  EDBT 2008»
14 years 10 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura