Sciweavers

4114 search results - page 618 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CC
2008
Springer
131views System Software» more  CC 2008»
13 years 9 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
DEBU
2010
108views more  DEBU 2010»
13 years 9 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
AMAI
2006
Springer
13 years 9 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
IJCSS
2007
122views more  IJCSS 2007»
13 years 9 months ago
Artificial Neural Network Type Learning with Single Multiplicative Spiking Neuron
In this paper, learning algorithm for a single multiplicative spiking neuron (MSN) is proposed and tested for various applications where a multilayer perceptron (MLP) neural netwo...
Deepak Mishra, Abhishek Yadav, Sudipta Ray, Prem K...
CG
2005
Springer
13 years 9 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...