Sciweavers

3719 search results - page 94 / 744
» order 2010
Sort
View
143
Voted
JCIT
2010
174views more  JCIT 2010»
14 years 10 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
SOCO
2010
Springer
15 years 7 months ago
An Advice for Advice Composition in AspectJ
Aspect composition often involves advice interference and this is a crucial problem in aspect oriented programming. When multiple advices are woven at the same join point, the advi...
Fuminobu Takeyama, Shigeru Chiba
DASFAA
2010
IEEE
127views Database» more  DASFAA 2010»
15 years 3 months ago
PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns
Gradual patterns highlight complex order correlations of the form “The more/less X, the more/less Y”. Only recently algorithms have appeared to mine efficiently gradual rules. ...
Anne Laurent, Benjamin Négrevergne, Nicolas...
125
Voted
SYNTHESE
2010
95views more  SYNTHESE 2010»
15 years 1 months ago
Ranking judgments in Arrow's setting
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
Daniele Porello
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
15 years 3 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez