Sciweavers

255 search results - page 30 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
TKDE
2008
171views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
AML
2008
124views more  AML 2008»
13 years 7 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
PATMOS
2007
Springer
14 years 1 months ago
Fast Calculation of Permissible Slowdown Factors for Hard Real-Time Systems
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
Henrik Lipskoch, Karsten Albers, Frank Slomka
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont
LATIN
2010
Springer
14 years 19 days ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri