Sciweavers

1887 search results - page 243 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
PR
2010
135views more  PR 2010»
13 years 3 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
SETN
2004
Springer
14 years 2 months ago
Incremental Mixture Learning for Clustering Discrete Data
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
Konstantinos Blekas, Aristidis Likas
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 9 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
ICDE
2003
IEEE
183views Database» more  ICDE 2003»
14 years 10 months ago
Skyline with Presorting
There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for "best" tupl...
Jan Chomicki, Parke Godfrey, Jarek Gryz, Dongming ...
ENTCS
2008
116views more  ENTCS 2008»
13 years 9 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis