Sciweavers

544 search results - page 2 / 109
» What cannot be computed locally!
Sort
View
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
13 years 9 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
CHI
2009
ACM
14 years 5 months ago
What's "this" you say?: the use of local references on distant displays
This study explores how the design of visual display configurations relates to linguistic expressions. Twenty-five participants performed a series of object identification and nar...
Patti Bao, Darren Gergle
ACL
2004
13 years 6 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
TCSV
2008
195views more  TCSV 2008»
13 years 5 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
CVPR
2005
IEEE
14 years 7 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas