Sciweavers

691 search results - page 64 / 139
» Axiomatizing geometric constructions
Sort
View
CCCG
2008
13 years 9 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
NIPS
2003
13 years 9 months ago
An MCMC-Based Method of Comparing Connectionist Models in Cognitive Science
Despite the popularity of connectionist models in cognitive science, their performance can often be difficult to evaluate. Inspired by the geometric approach to statistical model ...
Woojae Kim, Daniel J. Navarro, Mark A. Pitt, In Ja...
BMVC
1998
13 years 9 months ago
3D Trajectories from a Single Viewpoint using Shadows
We consider the problem of obtaining the 3D trajectory of a ball from a sequence of images taken with a camera which is possibly rotating and zooming (but not translating). Techni...
Ian D. Reid, A. North
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 9 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
FFA
2008
260views more  FFA 2008»
13 years 7 months ago
On the isotopism classes of finite semifields
A projective plane is called a translation plane if there exists a line L such that the group of elations with axis L acts transitively on the points not on L. A translation plane...
Michel Lavrauw