Sciweavers

96 search results - page 5 / 20
» Parikh Images of Regular Languages: Complexity and Applicati...
Sort
View
ICIP
2002
IEEE
14 years 11 months ago
DCT approximation for low bit rate coding using a conditional transform
A transform approximation is explored for speeding up the software compression of images and video. It is used to replace the regular DCT whenever only few DCT coefficients are ac...
Ricardo L. de Queiroz
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 2 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
TOG
2008
143views more  TOG 2008»
13 years 9 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
AAAI
2007
14 years 3 days ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
CVPR
2009
IEEE
15 years 4 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...