Sciweavers

1091 search results - page 59 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ESANN
2006
13 years 9 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
AIMSA
2010
Springer
13 years 9 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
CISS
2008
IEEE
14 years 2 months ago
Optimal path planning for mobile backbone networks
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
Anand Srinivas, Eytan Modiano
ESA
2009
Springer
94views Algorithms» more  ESA 2009»
14 years 2 months ago
Shape Fitting on Point Sets with Probability Distributions
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
Maarten Löffler, Jeff M. Phillips
EDBT
2011
ACM
231views Database» more  EDBT 2011»
12 years 11 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy