Sciweavers

2494 search results - page 216 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
IPPS
2002
IEEE
14 years 1 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
HPDC
2010
IEEE
13 years 9 months ago
Data parallelism in bioinformatics workflows using Hydra
Large scale bioinformatics experiments are usually composed by a set of data flows generated by a chain of activities (programs or services) that may be modeled as scientific work...
Fábio Coutinho, Eduardo S. Ogasawara, Danie...
ECCV
2008
Springer
14 years 10 months ago
Improving People Search Using Query Expansions
In this paper we are interested in finding images of people on the web, and more specifically within large databases of captioned news images. It has recently been shown that visua...
Thomas Mensink, Jakob J. Verbeek
SC
2009
ACM
14 years 2 months ago
Exploring many task computing in scientific workflows
One of the main advantages of using a scientific workflow management system (SWfMS) to orchestrate data flows among scientific activities is to control and register the whole work...
Eduardo S. Ogasawara, Daniel de Oliveira, Fernando...