Sciweavers

762 search results - page 14 / 153
» Finding SHA-1 Characteristics: General Results and Applicati...
Sort
View
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
IHM
2005
ACM
14 years 27 days ago
Une approche MDS hybride pour l'exploration visuelle interactive
The paper presents a novel technique for the exploration of an information space where elements are associated with a taxonomy and where each element has an associated attribute v...
Fabien Jourdan, Guy Melançon, Christophe Do...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 26 days ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
CIKM
2008
Springer
13 years 9 months ago
A system for finding biological entities that satisfy certain conditions from texts
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...
Wei Zhou, Clement T. Yu, Weiyi Meng
GIS
2010
ACM
13 years 5 months ago
Finding similar users using category-based location history
In this paper, we aim to estimate the similarity between users according to their GPS trajectories. Our approach first models a user’s GPS trajectories with a semantic location ...
Xiangye Xiao, Yu Zheng, Qiong Luo, Xing Xie