Sciweavers

994 search results - page 199 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
NIPS
2001
13 years 6 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ACL
1997
13 years 6 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
MM
2010
ACM
151views Multimedia» more  MM 2010»
13 years 5 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
TVCG
2010
126views more  TVCG 2010»
13 years 3 months ago
Modeling Repetitive Motions Using Structured Light
— Obtaining models of dynamic 3D objects is an important part of content generation for computer graphics. Numerous methods have been extended from static scenarios to model dyna...
Yi Xu, Daniel G. Aliaga