Sciweavers

2069 search results - page 153 / 414
» Linear time algorithms for Clobber
Sort
View
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
15 years 8 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 11 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
144
Voted
ALGOSENSORS
2010
Springer
15 years 3 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
15 years 8 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...