Sciweavers

366 search results - page 9 / 74
» Four equivalent equivalences of reductions
Sort
View
BIRTHDAY
2004
Springer
14 years 24 days ago
On NFA Reductions
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
Lucian Ilie, Gonzalo Navarro, Sheng Yu
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
13 years 9 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye
ENDM
2000
131views more  ENDM 2000»
13 years 7 months ago
Some Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
Bojan Mohar
FPCA
1987
13 years 11 months ago
Categorical multi-combinators
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
Rafael Dueire Lins
TCOM
2011
108views more  TCOM 2011»
13 years 2 months ago
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
— The computational complexity of optimum decoding for an orthogonal space-time block code is quantified. Four equivalent techniques of optimum decoding which have the same comp...
Ender Ayanoglu, Erik G. Larsson, Eleftherios Karip...