Sciweavers

442 search results - page 26 / 89
» Local Computation of PageRank Contributions
Sort
View
COLING
1996
15 years 7 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
GRID
2007
Springer
16 years 5 days ago
Resource usage policy expression and enforcement in grid computing
-- To date, not enough attention has been paid to issues surrounding the description and enforcement of policies for controlling Grid resources. These policies define the permitted...
Jun Feng, Glenn S. Wasson, Marty Humphrey
ISCA
1995
IEEE
93views Hardware» more  ISCA 1995»
15 years 9 months ago
Optimizing Memory System Performance for Communication in Parallel Computers
Communicationin aparallel systemfrequently involvesmoving data from the memory of one node to the memory of another; this is the standard communication model employedin message pa...
Thomas Stricker, Thomas R. Gross
VLSM
2005
Springer
15 years 11 months ago
Advances in Variational Image Segmentation Using AM-FM Models: Regularized Demodulation and Probabilistic Cue Integration
Current state-of-the-art methods in variational image segmentation using level set methods are able to robustly segment complex textured images in an unsupervised manner. In recent...
Georgios Evangelopoulos, Iasonas Kokkinos, Petros ...
ICCV
2007
IEEE
16 years 8 months ago
No Grouping Left Behind: From Edges to Curve Fragments
We present a framework for extracting image contours based on geometric and structural consistency among edge element locations and orientations. The paper presents two contributi...
Amir Tamrakar, Benjamin B. Kimia