Sciweavers

6562 search results - page 1129 / 1313
» Noetherianity and Combination Problems
Sort
View
RAS
2008
139views more  RAS 2008»
15 years 6 months ago
Unsupervised identification of useful visual landmarks using multiple segmentations and top-down feedback
In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in images sequences acquired by an indoor mobile robot. This is a high...
Pablo Espinace, Daniel Langdon, Alvaro Soto
RSA
2008
103views more  RSA 2008»
15 years 6 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 5 months ago
Network Intrusion Detection Using FP Tree Rules
----------------------------------------------ABSTRACT-------------------------------------------In the faceless world of the Internet, online fraud is one of the greatest reasons ...
P. Srinivasulu, J. Ranga Rao, I. Ramesh Babu
IAJIT
2010
124views more  IAJIT 2010»
15 years 5 months ago
Uplink Downlink Limited Round Robin Scheduling Algorithms
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
Rawya Rizk
ICASSP
2010
IEEE
15 years 5 months ago
Building pair-wise visual word tree for efficent image re-ranking
Bag-of-visual Words (BoW) image representation is getting popular in computer vision and multimedia communities. However, experiments show that the traditional BoW representation ...
Shiliang Zhang, Qingming Huang, Yijuan Lu, Wen Gao...
« Prev « First page 1129 / 1313 Last » Next »