Sciweavers

2957 search results - page 559 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ALGOSENSORS
2007
Springer
14 years 1 months ago
Counting Targets with Mobile Sensors in an Unknown Environment
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
Beat Gfeller, Matús Mihalák, Subhash...
CCS
2007
ACM
14 years 1 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
CIKM
2007
Springer
14 years 1 months ago
Nugget discovery in visual exploration environments by query consolidation
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
CMSB
2007
Springer
14 years 1 months ago
Expressive Models for Synaptic Plasticity
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...
Andrea Bracciali, Marcello Brunelli, Enrico Catald...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 1 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson