Sciweavers

1068 search results - page 180 / 214
» Factorization as a Rank 1 Problem
Sort
View
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
14 years 9 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
SIAMDM
2010
137views more  SIAMDM 2010»
14 years 8 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
ALGOSENSORS
2009
Springer
14 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
BMCBI
2011
14 years 4 months ago
Statistical learning techniques applied to epidemiology: a simulated case-control comparison study with logistic regression
Background: When investigating covariate interactions and group associations with standard regression analyses, the relationship between the response variable and exposure may be ...
John J. Heine, Walker H. Land Jr., Kathleen M. Ega...
EUROCRYPT
2012
Springer
13 years 4 days ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...