Sciweavers

2128 search results - page 144 / 426
» A general characterization of indulgence
Sort
View
ALT
2001
Springer
16 years 3 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
IEEEPACT
2009
IEEE
16 years 1 months ago
Analytical Modeling of Pipeline Parallelism
Parallel programming is a requirement in the multi-core era. One of the most promising techniques to make parallel programming available for the general users is the use of parall...
Angeles G. Navarro, Rafael Asenjo, Siham Tabik, Ca...
DOLAP
2009
ACM
16 years 1 months ago
A taxonomy of ETL activities
Extract-Transform-Load (ETL) activities are software modules responsible for populating a data warehouse with operational data, which have undergone a series of transformations on...
Panos Vassiliadis, Alkis Simitsis, Eftychia Baikou...
MM
2009
ACM
131views Multimedia» more  MM 2009»
16 years 1 months ago
TravelScope: standing on the shoulders of dedicated travelers
In this paper, we propose a system called TravelScope that helps users experience virtual tours by presenting information mined from user-generated travelogues and photos. The sys...
Qiang Hao, Rui Cai, Jiang-Ming Yang, Rong Xiao, Li...
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 29 days ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...