Sciweavers

757 search results - page 146 / 152
» How to decide
Sort
View
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 8 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
WCE
2007
13 years 8 months ago
VHDL Implementation of Multiplierless, High Performance DWT Filter Bank
—The JPEG 2000 image coding standard employs the biorthogonal 9/7 wavelet for lossy compression. The performance of hardware implementation of 9/7-filter bank depends on accuracy...
M. M. Aswale, R. B. Patil
ATAL
2010
Springer
13 years 8 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
ICARIS
2010
Springer
13 years 8 months ago
Defining a Simulation Strategy for Cancer Immunocompetence
Although there are various types of cancer treatments, none of these currently take into account the effect of ageing of the immune system and hence altered responses to cancer. R...
Grazziela P. Figueredo, Uwe Aickelin
CIE
2010
Springer
13 years 7 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov