Sciweavers

31 search results - page 6 / 7
» An Optimal Balanced Partitioning of a Set of 1D Intervals
Sort
View
92
Voted
IDA
2002
Springer
14 years 10 months ago
Classification and filtering of spectra: A case study in mineralogy
The ability to identify the mineral composition of rocks and soils is an important tool for the exploration of geological sites. Even though expert knowledge is commonly used for t...
Jonathan Moody, Ricardo Bezerra de Andrade e Silva...
ASPLOS
2006
ACM
15 years 2 months ago
Instruction scheduling for a tiled dataflow architecture
This paper explores hierarchical instruction scheduling for a tiled processor. Our results show that at the top level of the hierarchy, a simple profile-driven algorithm effective...
Martha Mercaldi, Steven Swanson, Andrew Petersen, ...
95
Voted
CLOUD
2010
ACM
15 years 3 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
89
Voted
SIGECOM
2008
ACM
220views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
Better redistribution with inefficient allocation in multi-unit auctions with unit demand
For the problem of allocating one or more items among a group of competing agents, the Vickrey-Clarke-Groves (VCG) mechanism is strategy-proof and efficient. However, the VCG mech...
Mingyu Guo, Vincent Conitzer
TCS
2008
14 years 10 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul