Sciweavers

13214 search results - page 2317 / 2643
» Pseudorandomness for network algorithms
Sort
View
JCT
1998
99views more  JCT 1998»
15 years 6 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
TPDS
2002
80views more  TPDS 2002»
15 years 6 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
TSMC
2002
110views more  TSMC 2002»
15 years 6 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
192
Voted
VLC
2008
314views more  VLC 2008»
15 years 6 months ago
A survey of methods for image annotation
In order to evaluate automated image annotation and object recognition algorithms, ground truth in the form of a set of images correctly annotated with text describing each image ...
Allan Hanbury
CIKM
2010
Springer
15 years 5 months ago
Automatic metadata extraction from multilingual enterprise content
Enterprises provide professionally authored content about their products/services in different languages for use in web sites and customer care. For customer care, personalization...
Melike Sah, Vincent Wade
« Prev « First page 2317 / 2643 Last » Next »