Sciweavers

1301 search results - page 239 / 261
» Bounded Version Vectors
Sort
View
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 10 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ECCV
2008
Springer
15 years 1 days ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 10 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
CHI
2004
ACM
14 years 10 months ago
3Book: a scalable 3D virtual book
This paper describes the 3Book, a 3D interactive visualization of a codex book as a component for digital library and information-intensive applications. The 3Book is able to repr...
Stuart K. Card, Lichan Hong, Jock D. Mackinlay, Ed...