Sciweavers

432 search results - page 80 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
103
Voted
CAMP
2005
IEEE
15 years 5 months ago
Real-Time Low Level Feature Extraction for On-Board Robot Vision Systems
Abstract— Robot vision systems notoriously require large computing capabilities, rarely available on physical devices. Robots have limited embedded hardware, and almost all senso...
Roberto Pirrone, Giuseppe Careri, F. Saverio Fabia...
88
Voted
EUROPAR
2005
Springer
15 years 5 months ago
A Grid Information Service Based on Peer-to-Peer
Abstract. Information Services are fundamental blocks of the Grid infrastructure. They are responsible for collecting and distributing information about resource availability and s...
Diego Puppin, Stefano Moncelli, Ranieri Baraglia, ...
91
Voted
ATAL
2010
Springer
15 years 22 days ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 5 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
BMCBI
2006
138views more  BMCBI 2006»
14 years 11 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...