3656 search results - page 393 / 732 » Compact Location Problems |
202
click to vote
MICRO
2005
IEEE
16 years 8 days ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
184
click to vote
SIGIR
2005
ACM
16 years 7 days ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
181
click to vote
IWDC
2005
Springer
16 years 5 days ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
178
click to vote
ICDM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract—Despite the considerable amount of research work on the application of Gabor filters in pattern classification, their design and selection have been mostly done on a t...
222
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...