Sciweavers

458 search results - page 66 / 92
» Linear Time Algorithms for Clustering Problems in Any Dimens...
Sort
View
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 2 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
WINE
2009
Springer
147views Economy» more  WINE 2009»
14 years 29 days ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
CPM
2007
Springer
115views Combinatorics» more  CPM 2007»
14 years 2 months ago
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
Amihood Amir, Johannes Fischer, Moshe Lewenstein
ICPPW
2002
IEEE
14 years 1 months ago
Hebbian Algorithms for a Digital Library Recommendation System
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
Francis Heylighen, Johan Bollen
AAAI
1998
13 years 9 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...