Sciweavers

4103 search results - page 197 / 821
» Some results on the Collatz problem
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 7 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
ICASSP
2008
IEEE
16 years 1 months ago
Generalized Improved Spread Spectrum watermarking robust against translation attacks
In this work, we consider the ISS (improved spread spectrum) watermarking [1] framework, and propose a generalized version of it, termed “Generalized Improved Spread Spectrum”...
Neslihan Gerek, Mehmet Kivanç Mihçak
DAGM
2007
Springer
16 years 26 days ago
Recursive Estimation with Implicit Constraints
Recursive estimation or Kalman filtering usually relies on explicit model functions, that directly and explicitly describe the effect of the parameters on the observations. Howeve...
Richard Steffen, Christian Beder
ICLP
2005
Springer
16 years 6 days ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
153
Voted
DAC
1995
ACM
15 years 10 months ago
Code Optimization Techniques for Embedded DSP Microprocessors
—We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventiona...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...