Sciweavers

18306 search results - page 8 / 3662
» Algorithmics in Exponential Time
Sort
View
SAS
2004
Springer
14 years 1 months ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
COMPGEOM
2009
ACM
14 years 10 days ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
FDTC
2006
Springer
120views Cryptology» more  FDTC 2006»
13 years 11 months ago
Blinded Fault Resistant Exponentiation
As the core operation of many public key cryptosystems, group exponentiation is central to cryptography. Attacks on its implementation in embedded device setting is hence of great ...
Guillaume Fumaroli, David Vigilant
ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
13 years 7 months ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt
ICDE
2008
IEEE
122views Database» more  ICDE 2008»
14 years 9 months ago
Exponentially Decayed Aggregates on Data Streams
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
Graham Cormode, Flip Korn, Srikanta Tirthapura