Sciweavers

8294 search results - page 262 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
16 years 9 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
IEAAIE
2005
Springer
16 years 14 days ago
A Fuzzy Genetic Algorithm for Real-World Job Shop Scheduling
In this paper, a multi-objective genetic algorithm is proposed to deal with a real-world fuzzy job shop scheduling problem. Fuzzy sets are used to model uncertain due dates and pro...
Carole Fayad, Sanja Petrovic
IVC
2008
145views more  IVC 2008»
15 years 7 months ago
Camera calibration from human motion
This paper presents a method for the self-calibration of non-rigid affine structure to a Euclidean co-ordinate frame from only two views by enforcing constraints derived from the ...
Philip A. Tresadern, Ian D. Reid
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 8 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
16 years 14 days ago
Estimating the detector coverage in a negative selection algorithm
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
Zhou Ji, Dipankar Dasgupta