Sciweavers

1096 search results - page 163 / 220
» Evaluating Algorithms for Concept Description
Sort
View
ICS
2010
Tsinghua U.
14 years 1 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
PODS
2011
ACM
201views Database» more  PODS 2011»
12 years 11 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
CCS
2007
ACM
14 years 2 months ago
Managing RBAC states with transitive relations
In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that ...
Chaoyi Pang, David P. Hansen, Anthony J. Maeder
IPMI
2005
Springer
14 years 2 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr