Sciweavers

4924 search results - page 549 / 985
» Efficiency Improvement for NTRU
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
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
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 7 months ago
SOR: A Practical System for Ontology Storage, Reasoning and Search
Ontology, an explicit specification of shared conceptualization, has been increasingly used to define formal data semantics and improve data reusability and interoperability in en...
Chen Wang, Jean-Sébastien Brunner, Jing Lu,...
ICIAP
2003
ACM
16 years 7 months ago
Smart interpolation by anisotropic diffusion
To be able to enlarge a digital image from a single frame preserving the perceptive cues is a relevant research issue. The best algorithms take into account the presence of edges ...
Sebastiano Battiato, Giovanni Gallo, Filippo Stanc...
ICSE
2008
IEEE-ACM
16 years 7 months ago
MontiCore: a framework for the development of textual domain specific languages
In this paper we demonstrate a framework for efficient development of textual domain specific languages and supporting tools. We use a redundance-free and compact definition of le...
Bernhard Rumpe, Hans Grönniger, Holger Krahn,...