Sciweavers

649 search results - page 28 / 130
» Visualization in string theory
Sort
View
136
Voted
CVPR
1997
IEEE
15 years 7 months ago
Learning Generic Prior Models for Visual Computation
This paper presents a novel theory for learning generic prior models from a set of observed natural images based on a minimax entropy theory that the authors studied in modeling t...
Song Chun Zhu, David Mumford
JUCS
2010
139views more  JUCS 2010»
14 years 10 months ago
Validating Modal Aspects of OntoUML Conceptual Models Using Automatically Generated Visual World Structures
: Assessing the quality of conceptual models is key to ensure that conceptual models can be used effectively as a basis for understanding, agreement and construction of information...
Alessander Botti Benevides, Giancarlo Guizzardi, B...
LATA
2009
Springer
15 years 10 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
IJCM
2010
80views more  IJCM 2010»
15 years 1 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
IACR
2011
152views more  IACR 2011»
14 years 2 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa