Sciweavers

1720 search results - page 16 / 344
» eg 2008
Sort
View
TIT
2008
107views more  TIT 2008»
13 years 8 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
CAGD
2000
246views more  CAGD 2000»
13 years 8 months ago
Estimation of the principle curvatures of approximated surfaces
This paper presents a method for estimating curvature values of a surface, which is given only approximatively, e.g., by measured data. The presented method requires estimates of ...
Christian Wollmann
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 8 months ago
Analysis Patterns for GIS Data Schema Reuse on Urban Management Applications
An analysis pattern is any part of a requirement analysis specification that can be reused in the design of other information systems as well. Urban management systems (e.g.: Tax ...
Jugurta Lisboa Filho, Cirano Iochpe, Karla A. V. B...
DKE
2002
130views more  DKE 2002»
13 years 8 months ago
Smart card embedded information systems: a methodology for privacy oriented architectural design
The design of very small databases for smart cards and for portable embedded systems is deeply constrained by the peculiar features of the physical medium. Privacy concerns are re...
Cristiana Bolchini, Fabio A. Schreiber
DM
2002
114views more  DM 2002»
13 years 8 months ago
C4-saturated bipartite graphs
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
Darryn E. Bryant, Hung-Lin Fu