Sciweavers

1541 search results - page 175 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 3 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
ICCV
2003
IEEE
14 years 10 months ago
Learning a Classification Model for Segmentation
We propose a two-class classification model for grouping. Human segmented natural images are used as positive examples. Negative examples of grouping are constructed by randomly m...
Xiaofeng Ren, Jitendra Malik
CIVR
2007
Springer
280views Image Analysis» more  CIVR 2007»
14 years 2 months ago
Demonstration of image retrieval based on illumination invariant textural MRF features
Content-based image retrieval (CBIR) systems target database images using feature similarities with respect to the query. Our CBIR demonstration utilises novel illumination invari...
Pavel Vacha, Michal Haindl
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 8 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis