Results 11  20
of
8,585
Towards a Theory of Homomorphic Compression
"... Abstract. In this talk we survey recent progress on designing homomorphic fingerprints. Fingerprinting is a classic randomized technique for efficiently verifying whether two files are equal. We will discuss two extensions of this basic functionality: a) verifying whether two text files are cyclic s ..."
Abstract
 Add to MetaCart
shifts of one another and b) when the files correspond to “address books”, verifying whether the resulting social network is connected. Underlying both results is the idea of homomorphic lossy compression, i.e., lossy data compression that supports a range of operations on the compressed data
Solving Systems of Polynomial Equations
 AMERICAN MATHEMATICAL SOCIETY, CBMS REGIONAL CONFERENCES SERIES, NO 97
, 2002
"... One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, ..."
Abstract

Cited by 221 (14 self)
 Add to MetaCart
One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory, and numerous other areas. The set of solutions to a system of polynomial equations is an algebraic variety, the basic object of algebraic geometry. The algorithmic study of algebraic varieties is the central theme of computational algebraic geometry. Exciting recent developments in symbolic algebra and numerical software for geometric calculations have revolutionized the field, making formerly inaccessible problems tractable, and providing fertile ground for experimentation and conjecture. The first half of this book furnishes an introduction and represents a snapshot of the state of the art regarding systems of polynomial equations. Afficionados of the wellknown text books by Cox, Little, and O’Shea will find familiar themes in the first five chapters: polynomials in one variable, Gröbner
Reusing Software: Issues And Research Directions
, 1995
"... Software productivity has been steadily increasing over the last 30 years, but not enough to close the gap between the demands placed on the software industry and what the state of the practice can deliver [22,39]; nothing short of an order of magnitude increase in productivity will extricate the so ..."
Abstract

Cited by 207 (8 self)
 Add to MetaCart
Software productivity has been steadily increasing over the last 30 years, but not enough to close the gap between the demands placed on the software industry and what the state of the practice can deliver [22,39]; nothing short of an order of magnitude increase in productivity will extricate the software industry from its perennial crisis [39,67]. Several decades of intensive research in software engineering and artificial intelligence left few alternatives but software reuse as the (only) realistic approach to bring about the gains of productivity and quality that the software industry needs. In this paper, we discuss the implications of reuse on the production, with an emphasis on the technical challenges. Software reuse involves building software that is reusable by design, and building with reusable software. Software reuse includes reusing both the products of previous software projects, and the processes deployed to produce them, leading to a wide spectrum of reuse approaches, from the building blocks (reusing products) approach on one hand, to the generative or reusable processor (reusing processes) on the other [68]. We discuss the implications of such approaches on the organization, control, and method of software development and discuss proposed models for their economic analysis. Software reuse benefits from methodologies and tools to: 1) build more readily reusable software, and 2) locate, evaluate, and tailor reusable software, the latter being critical for the building blocks approach. Both sets of issues are discussed in this paper, with a focus on application generators and objectoriented development for the first, and a thorough discussion of retrieval techniques for software components, component composition (or bottomup design) and transformational systems for the second. We conclude by highlighting areas that, in our opinion, are worthy of further investigation.
Approximating edit distance efficiently
 In Proc. FOCS 2004
, 2004
"... Edit distance has been extensively studied for the past several years. Nevertheless, no lineartime algorithm is known to compute the edit distance between two strings, or even to approximate it to within a modest factor. Furthermore, for various natural algorithmic problems such as lowdistortion e ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
distortion embeddings into normed spaces, approximate nearestneighbor schemes, and sketching algorithms, known results for the edit distance are rather weak. We develop algorithms that solve gap versions of the edit distance problem: given two strings of length n with the promise that their edit distance is either
Psychological Sketches (Fifth Edition)
, 2001
"... plac enta, 101 Planc k, Max, 23 play, 119 Playboy, 215 Prec n Procb) and Equipment, 209 pregnanc y, 101 primatec ommunic ation, 147 priming, 175 Prin c Edward Island, 230 prototype, 14 proximate explanation, 52 psyc hedelic , 234 psyc hiatrists, 97 Psyc hologic alLaw,35 psyc hology professors, 221 ..."
Abstract
 Add to MetaCart
plac enta, 101 Planc k, Max, 23 play, 119 Playboy, 215 Prec n Procb) and Equipment, 209 pregnanc y, 101 primatec ommunic ation, 147 priming, 175 Prin c Edward Island, 230 prototype, 14 proximate explanation, 52 psyc hedelic , 234 psyc hiatrists, 97 Psyc hologic alLaw,35 psyc hology professors, 221 psyc hopathology, 80 psyc hotherapy, 98 puberty, 101 Public Library, 99 Quebec 230 Queen, 218 radar, 128 Reber, Arthur, 224 recfl tive sites, 132 rec iproc al altruism, 160, 162 Red Menac3 98 relapse, 98 Reno, Nevada, 220 replic ation, 26 repression, 210 reproduc tive suc c ess, 155, 188 retina, 129 retrograde amnesia, 174 right hemisphere, 95 risk, 99 salmon migration, 24 satanic messages, 208 sc hedules of reinforc' ent, 63 sc hizophrenia, 97 sc ientific law, 33 Sc oville, W., 173 seaweed, 229 selec tive attention, 214 sensation, 103 sentient mac hines, 211 sex, 197 sex di#eren cen 51 sexual behaviour, 93 sexualc oerc ion, 192 Sherif, 105 signal averaging, 177 Sisters of Mankato, 83 Six
The Fingerprint Inquiry Report Volume The Fingerprint
"... Where the Inquiry has identified any material which comes from a third party, you need to obtain permission from the copyright holder(s) in that material. © Crown copyright 2011 Published on behalf of The Fingerprint Inquiry by APS Group Scotland This document is also available for download from: ww ..."
Abstract
 Add to MetaCart
Where the Inquiry has identified any material which comes from a third party, you need to obtain permission from the copyright holder(s) in that material. © Crown copyright 2011 Published on behalf of The Fingerprint Inquiry by APS Group Scotland This document is also available for download from
Secure sketch for biometric templates
 In Asiacrypt
, 2006
"... Abstract. There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a sketch. It is desirable that the sketch reveals little information about the biometric templates even in the wors ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
Abstract. There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a sketch. It is desirable that the sketch reveals little information about the biometric templates even
Low distortion embeddings for edit distance
 In Proceedings of the Symposium on Theory of Computing
, 2005
"... We show that {0, 1} d endowed with edit distance embeds into ℓ1 with distortion 2 O( √ log d log log d). We further show efficient implementations of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, neare ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
We show that {0, 1} d endowed with edit distance embeds into ℓ1 with distortion 2 O( √ log d log log d). We further show efficient implementations of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of the TwentyFourth Annual ACM Symposium on Theory of Computing, pages 339369, Victoria, B.C., Canada, May 1992. (225) [207] L. G. Khachian. A polynomial time algorithm for linear programming. Doklady Akademii Nauk SSSR, n.s., 244(5):10931096, 1979. English translation in Soviet Math. Dokl. 20, 191194. (150, 151, 153) [208] S. Khuller. On computing graph closures. Information Processing Letters, 31(5):249255, 12 June 1989. (142, 224) [209] S. Khuller and B. Schieber. E#cient parallel algorithms for testing k connectivity and finding disjoint st paths in graphs. SIAM Journal on Computing, 20(2):352375, April 1991. (134) [210] G. A. P. Kindervater and J. K. Lenstra. An introduction to parallelism in combinatorial optimization. In J. van Leeuwen and J. K. Lenstra, editors, Parallel Computers and Computation, volume 9 of CWI Syllabus, pages 163184. Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1985. (17) [211] G. A. P. Kindervater and J. K. Lenstra. Parallel algorithms. In M. O'hEigeartaigh, J. K. Lenstra, and A. H. G. Rinnooy Kan, editors, Combinatorial Optimization: Annotated Bibliographies, chapter 8, pages 106128. John Wiley & Sons, Chichester, 1985. (17, 21) [212] G. A. P. Kindervater, J. K. Lenstra, and D. B. Shmoys. The parallel complexity of TSP heuristics. Journal of Algorithms, 10(2):249270, June 1989. (138) 272 BIBLIOGRAPHY [213] G. A. P. Kindervater and H. W. J. M. Trienekens. Experiments with parallel algorit...
Results 11  20
of
8,585