Sciweavers

3946 search results - page 51 / 790
» The computational complexity of choice sets
Sort
View
ISVC
2007
Springer
15 years 6 months ago
A New Set of Normalized Geometric Moments Based on Schlick's Approximation
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
Ramakrishnan Mukundan
CP
2005
Springer
15 years 5 months ago
Encoding Requests to Web Service Compositions as Constraints
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
Alexander Lazovik, Marco Aiello, Rosella Gennari
BMCBI
2005
152views more  BMCBI 2005»
14 years 11 months ago
Ranking the whole MEDLINE database according to a large training set using text indexing
Background: The MEDLINE database contains over 12 million references to scientific literature, ut 3/4 of recent articles including an abstract of the publication. Retrieval of ent...
Brian P. Suomela, Miguel A. Andrade
CEC
2008
IEEE
15 years 6 months ago
Automatic model type selection with heterogeneous evolution: An application to RF circuit block modeling
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...
ICC
2007
IEEE
15 years 6 months ago
A Cost-Effective Approach to Optical Packet/burst Scheduling
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
Franco Callegati, Aldo Campi, Walter Cerroni