Sciweavers

105 search results - page 18 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
CVPR
2010
IEEE
14 years 7 months ago
Direct Image Alignment of Projector-Camera Systems with Planar Surfaces
Projector-camera systems use computer vision to analyze their surroundings and display feedback directly onto real world objects, as embodied by spatial augmented reality. To be e...
Samuel Audet, Masatoshi Okutomi, Masayuki Tanaka
INFOVIS
2005
IEEE
14 years 4 months ago
Dynamic Visualization of Graphs with Extended Labels
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
Pak Chung Wong, Patrick Mackey, Ken Perrine, James...
NIPS
2004
14 years 7 days ago
Spike Sorting: Bayesian Clustering of Non-Stationary Data
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
Aharon Bar-Hillel, Adam Spiro, Eran Stark
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 11 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 12 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli