Sciweavers

52 search results - page 3 / 11
» Generalized ERSS tree model: Revisiting working sets
Sort
View
SAC
2004
ACM
13 years 11 months ago
Interval and dynamic time warping-based decision trees
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Juan José Rodríguez, Carlos J. Alons...
ISIPTA
2003
IEEE
102views Mathematics» more  ISIPTA 2003»
13 years 11 months ago
A Sensitivity Analysis for the Pricing of European Call Options in a Binary Tree Model
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...
Huguette Reynaerts, Michèle Vanmaele
PODS
2010
ACM
242views Database» more  PODS 2010»
13 years 11 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
COR
2008
142views more  COR 2008»
13 years 5 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
IPSN
2009
Springer
14 years 17 days ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...