Sciweavers

8294 search results - page 836 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
FPCA
1995
15 years 11 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
ICONIP
2007
15 years 9 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 9 months ago
Querying and Managing Provenance through User Views in Scientific Workflows
Abstract-- Workflow systems have become increasingly popular for managing experiments where many bioinformatics tasks are chained together. Due to the large amount of data generate...
Olivier Biton, Sarah Cohen Boulakia, Susan B. Davi...
IPSN
2010
Springer
15 years 9 months ago
Information processing for live photo mosaic with a group of wireless image sensors
Photo tourism [11] is a platform that allows users to transform unstructured online digital photos into a 3D experience. Nowadays, image sensors are being extensively used to allo...
Fulu Li, James Barabas, Ana L. Santos
COMPGEOM
2006
ACM
15 years 11 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi