Sciweavers

2252 search results - page 343 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
148
Voted
SIAMCOMP
2000
161views more  SIAMCOMP 2000»
15 years 2 months ago
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vi...
124
Voted
ICCV
2009
IEEE
16 years 7 months ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
216
Voted
ICDE
2008
IEEE
169views Database» more  ICDE 2008»
16 years 4 months ago
Common Influence Join: A Natural Join Operation for Spatial Pointsets
We identify and formalize a novel join operator for two spatial pointsets P and Q. The common influence join (CIJ) returns the pairs of points (p, q), p P, q Q, such that there e...
Man Lung Yiu, Nikos Mamoulis, Panagiotis Karras
119
Voted
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 2 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
133
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 2 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström