Sciweavers

551 search results - page 35 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
INTEGRATION
2002
57views more  INTEGRATION 2002»
13 years 8 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel
IGPL
1998
97views more  IGPL 1998»
13 years 8 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
PAMI
2007
107views more  PAMI 2007»
13 years 8 months ago
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
—In this paper, based on ideas from lossy data coding and compression, we present a simple but effective technique for segmenting multivariate mixed data that are drawn from a mi...
Yi Ma, Harm Derksen, Wei Hong, John Wright
FSS
2010
107views more  FSS 2010»
13 years 7 months ago
Cut approach to islands in rectangular fuzzy relations
The paper investigates fuzzy relations on a finite domain in the cutworthy framework, dealing with a new property coming from the information theory. If the domain of a relation i...
Eszter K. Horváth, Branimir Seselja, Andrej...
JASIS
2010
125views more  JASIS 2010»
13 years 7 months ago
So mechanical or routine: The not original in Feist
The United States Supreme Court case of 1991, Feist Publications, Inc. v. Rural Tel. Service Co., continues to be highly significant for property in data and databases but remains...
Julian Warner