Sciweavers

587 search results - page 27 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
CCGRID
2004
IEEE
14 years 12 days ago
Understanding Grid resource information management through a synthetic database benchmark/workload
Management of grid resource information is a challenging and important area considering the potential size of the grid and wide range of resources that should be represented. Thou...
Beth Plale, C. Jacobs, Scott Jensen, Ying Liu, C. ...
IJHPCN
2006
109views more  IJHPCN 2006»
13 years 8 months ago
Communication issues within high performance computing grids
: This paper presents several ideas pertaining to desirable properties associated with protocols for moving large amounts of data over a grid of high performance computers. The pro...
Robert D. McLeod, Sajid Hussain, Sheng Huang, Mare...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 1 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
ICCV
2005
IEEE
14 years 2 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
SIROCCO
2004
13 years 10 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein