212 search results - page 30 / 43 » Classification of integral lattices with large class number |
DCC
1995
IEEE
14 years 43 min ago
1995
IEEE
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
BMCBI
2006
13 years 8 months ago
2006
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
INTERNET
2006
13 years 8 months ago
2006
Web services provide abstractions for simplifying integration at lower levels of the interaction stacks, they don't yet help simplify integration at higher abstraction levels ...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
Obtaining high-quality and up-to-date labeled data can be difficult in many real-world machine learning applications, especially for Internet classification tasks like review spam...
DAM
2008
13 years 8 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...