Sciweavers

3575 search results - page 636 / 715
» Structured motifs search
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 10 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 10 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
ECCV
2010
Springer
15 years 9 months ago
Recursive Coarse-to-Fine Localization for fast Object Detection
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
Marco Pedersoli, Jordi Gonzàlez, Andrew D. Bagdan...
AAAI
2008
15 years 8 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
ASWC
2008
Springer
15 years 8 months ago
Efficient Index Maintenance for Frequently Updated Semantic Data
Abstract. Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Sem...
Yan Liang, Haofen Wang, Qiaoling Liu, Thanh Tran, ...