Sciweavers

1887 search results - page 8 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 9 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
IPL
2008
131views more  IPL 2008»
13 years 7 months ago
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
J. Francisco Chicano, Enrique Alba
ICMCS
2006
IEEE
147views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Efficient Motion Estimation using Sorting-Based Partial Distortion Search
An efficient motion-estimation algorithm based on partial block distortion using sorted significant features including bit-plane and mean is proposed. The proposed algorithm can o...
Chou-Chen Wang, Chia-jung Lo, Cheng-Wei Yu
IJCAI
2001
13 years 9 months ago
Reviving Partial Order Planning
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
XuanLong Nguyen, Subbarao Kambhampati
ICPR
2006
IEEE
14 years 8 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai