Sciweavers

20294 search results - page 3800 / 4059
» Algorithmic Information Theory
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 12 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
DRM
2003
Springer
15 years 12 months ago
Constructing a virtual primary key for fingerprinting relational data
Agrawal and Kiernan’s watermarking technique for database relations [1] and Li et al’s fingerprinting extension [6] both depend critically on primary key attributes. Hence, t...
Yingjiu Li, Vipin Swarup, Sushil Jajodia
GECCO
2003
Springer
15 years 12 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
IBPRIA
2003
Springer
15 years 12 months ago
Does Independent Component Analysis Play a~Role in Unmixing Hyperspectral Data?
—Independent component analysis (ICA) has recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: 1) the observed spectrum vector is a li...
José M. P. Nascimento, José M. B. Di...
WWW
2010
ACM
15 years 11 months ago
FormSys: form-processing web services
In this paper we present FormSys, a Web-based system that service-enables form documents. It offers two main services: filling in forms based on Web services’ incoming SOAP me...
Ingo M. Weber, Hye-Young Paik, Boualem Benatallah,...
« Prev « First page 3800 / 4059 Last » Next »