2107 search results - page 298 / 422 » Computing Small Search Numbers in Linear Time |
IEEEPACT
2002
IEEE
14 years 2 months ago
2002
IEEE
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
DCOSS
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we study the code distribution problem in multi-application wireless sensor networks (MA-WSNs), i.e., sensor networks that can support multiple applications. While M...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
COLING
2010
13 years 4 months ago
2010
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...