Sciweavers

8431 search results - page 1316 / 1687
» Algorithmically Independent Sequences
Sort
View
ADBIS
2009
Springer
128views Database» more  ADBIS 2009»
16 years 1 months ago
Detecting Moving Objects in Noisy Radar Data Using a Relational Database
Abstract. In moving object databases, many authors assume that number and position of objects to be processed are always known in advance. Detecting an unknown moving object and pu...
Andreas Behrend, Rainer Manthey, Gereon Schül...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
16 years 1 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
16 years 1 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
ISW
2009
Springer
16 years 1 months ago
Towards Security Notions for White-Box Cryptography
Abstract. While code obfuscation attempts to hide certain characteristics of a program independently of an application, white-box cryptography (WBC) specifically focuses on softwa...
Amitabh Saxena, Brecht Wyseur, Bart Preneel
PPDP
2009
Springer
16 years 1 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
« Prev « First page 1316 / 1687 Last » Next »