Sciweavers

724 search results - page 71 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
WWW
2005
ACM
16 years 15 days ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
ITSL
2008
15 years 1 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
CJ
2008
108views more  CJ 2008»
14 years 12 months ago
Computing with Time: From Neural Networks to Sensor Networks
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
Boleslaw K. Szymanski, Gilbert Chen
HEURISTICS
2006
197views more  HEURISTICS 2006»
14 years 12 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
HPCA
2006
IEEE
16 years 6 days ago
Software-hardware cooperative memory disambiguation
In high-end processors, increasing the number of in-flight instructions can improve performance by overlapping useful processing with long-latency accesses to the main memory. Buf...
Ruke Huang, Alok Garg, Michael C. Huang