338 search results - page 43 / 68 » Approximation Spaces and Information Granulation |
116
click to vote
ICGI
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
108
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
139
Voted
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
120
click to vote
NIPS
2003
15 years 3 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
137
click to vote
BCB
2010
14 years 9 months ago
2010
A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electrondensity map. In previous work, we developed Acmi, a probabilist...