6568 search results - page 1276 / 1314 » Reducing the Complexity of Reductions |
152
Voted
SIROCCO
2010
15 years 7 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
156
Voted
IADIS
2008
15 years 7 months ago
2008
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
240
click to vote
NIPS
2008
15 years 7 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
164
click to vote
SERVICES
2008
15 years 7 months ago
2008
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
174
click to vote
TREC
2008
15 years 7 months ago
2008
In the TREC 2008, the team from the State University of New York at Buffalo participated in the Legal track and the Blog track. For the Legal track, we worked on the interactive s...