Sciweavers

3818 search results - page 593 / 764
» Word Problems on Compressed Words
Sort
View
KAIS
2008
81views more  KAIS 2008»
15 years 6 months ago
Maximum entropy based significance of itemsets
We consider the problem of defining the significance of an itemset. We say that the itemset is significant if we are surprised by its frequency when compared to the frequencies of ...
Nikolaj Tatti
JMIV
2006
124views more  JMIV 2006»
15 years 6 months ago
Iterative Total Variation Regularization with Non-Quadratic Fidelity
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
Lin He, Martin Burger, Stanley Osher
ENTCS
2007
131views more  ENTCS 2007»
15 years 6 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo
ENTCS
2007
93views more  ENTCS 2007»
15 years 6 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ML
2008
ACM
162views Machine Learning» more  ML 2008»
15 years 6 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch