Sciweavers

43 search results - page 3 / 9
» Do Agile Methods Marginalize Problem Solvers
Sort
View
CA
2002
IEEE
14 years 10 days ago
Spacetime Sweeping: An Interactive Dynamic Constraints Solver
This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness o...
Seyoon Tak, Oh-Young Song, Hyeong-Seok Ko
ECCV
2010
Springer
14 years 22 days ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
ALT
2004
Springer
14 years 4 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 20 days ago
SDP for multi-criterion QMF bank design
Quadraturemirror filter(QMF)bank with multi-criterion constraints suchas minimal aliasing and/or minimal error coding is amongthe most important problems in filter bank design, fo...
H. D. Tuan, L. H. Nam, H. Tuy, T. Q. Nguyen
VLDB
1994
ACM
134views Database» more  VLDB 1994»
13 years 11 months ago
V-Trees - A Storage Method for Long Vector Data
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
Maurício R. Mediano, Marco A. Casanova, Mar...