Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ENTCS
2008
124views more  ENTCS 2008»
11 years 28 days ago
Stability for Effective Algebras
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
MOC
1998
111views more  MOC 1998»
11 years 1 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin
EJC
2006
11 years 1 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik
NAACL
1994
11 years 2 months ago
Combining Knowledge Sources to Reorder N-Best Speech Hypothesis Lists
A simple and general method is described that can combine different knowledge sources to reorder N-best lists of hypotheses produced by a speech recognizer. The method is automati...
Manny Raynez, David Carter, Vassilios Digalakis, P...
NIPS
2008
11 years 2 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang
SIGGRAPH
1994
ACM
11 years 5 months ago
Piecewise smooth surface reconstruction
We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of ap...
Hugues Hoppe, Tony DeRose, Tom Duchamp, Mark A. Ha...
PKC
2001
Springer
163views Cryptology» more  PKC 2001»
11 years 5 months ago
Fast Irreducibility and Subgroup Membership Testing in XTR
Abstract. We describe a new general method to perform part of the setup stage of the XTR system introduced at Crypto 2000, namely finding the trace of a generator of the XTR group...
Arjen K. Lenstra, Eric R. Verheul
ISVLSI
2005
IEEE
115views VLSI» more  ISVLSI 2005»
11 years 7 months ago
Quasi-Exact BDD Minimization Using Relaxed Best-First Search
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Rüdiger Ebendt, Rolf Drechsler
ESWS
2009
Springer
11 years 8 months ago
Ontology Integration Using Mappings: Towards Getting the Right Logical Consequences
Abstract. We propose a general method and novel algorithmic techniques to facilitate the integration of independently developed ontologies using mappings. Our method and techniques...
Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau,...
ICIP
2003
IEEE
12 years 3 months ago
A method for reassembling fragments in image reconstruction
The reassembly of fragments to reconstruct images and objects is a problem often encountered in several applications, ranging from archeology to medicine. In this paper we present...
Francesco Amigoni, Stefano Gazzani, Simone Podico
books