Sciweavers

1397 search results - page 252 / 280
» Algorithms for Proximity Problems on Colored Point Sets
Sort
View
WDAG
2007
Springer
102views Algorithms» more  WDAG 2007»
14 years 2 months ago
A Denial-of-Service Resistant DHT
We consider the problem of designing scalable and robust information systems based on multiple servers that can survive even massive denial-of-service (DoS) attacks. More precisely...
Baruch Awerbuch, Christian Scheideler
ICIP
2005
IEEE
14 years 2 months ago
Towards arbitrary camera movements for image cube trajectory analysis
Image Cube Trajectory (ICT) Analysis is a new and robust method to estimate the 3D structure of a scene from a set of 2D images. For a moving camera each 3D point is represented b...
Ingo Feldmann, Peter Eisert, Peter Kauff
DAC
1996
ACM
14 years 19 days ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 10 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 9 months ago
Multiobjective robustness for portfolio optimization in volatile environments
Multiobjective methods are ideal for evolving a set of portfolio optimisation solutions that span a range from highreturn/high-risk to low-return/low-risk, and an investor can cho...
Ghada Hassan, Christopher D. Clack