Sciweavers

15485 search results - page 365 / 3097
» Computing Optimal Subsets
Sort
View
CODES
2002
IEEE
15 years 11 months ago
The design context of concurrent computation systems
Design for performance-optimization of programmable, semicustom SoCs requires the ability to model and optimize the behavior of the system as a whole. Neither the hardware-testben...
JoAnn M. Paul, Christopher M. Eatedali, Donald E. ...
WSC
2008
15 years 9 months ago
Comparing designs for computer simulation experiments
The use of simulation as a modeling and analysis tool is wide spread. Simulation is an enabling tool for experimenting virtually on a validated computer environment. Often the und...
Rachel T. Johnson, Bradley Jones, John W. Fowler, ...
AAAI
2010
15 years 8 months ago
Generalized Task Markets for Human and Machine Computation
We discuss challenges and opportunities for developing generalized task markets where human and machine intelligence are enlisted to solve problems, based on a consideration of th...
Dafna Shahaf, Eric Horvitz
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 6 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
CORR
2008
Springer
52views Education» more  CORR 2008»
15 years 6 months ago
Weighted distance transforms generalized to modules and their computation on point lattices
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated ...
Céline Fouard, Robin Strand, Gunilla Borgef...