Sciweavers

5105 search results - page 369 / 1021
» An algorithm to determine peer-reviewers
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 10 days ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran
SAT
2005
Springer
162views Hardware» more  SAT 2005»
16 years 10 days ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
16 years 10 days ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl
VLDB
2005
ACM
114views Database» more  VLDB 2005»
16 years 10 days ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia
ALGOSENSORS
2004
Springer
16 years 7 days ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...