Sciweavers

667 search results - page 6 / 134
» Computably Based Locally Compact Spaces
Sort
View
BMVC
2010
13 years 5 months ago
Learning Directional Local Pairwise Bases with Sparse Coding
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
Nobuyuki Morioka, Shin'ichi Satoh
CGA
2004
13 years 7 months ago
Flexible Point-Based Rendering on Mobile Devices
Point-based rendering is a compact and efficient means of displaying complex geometry. Our goal is to enable flexible point-based rendering, permitting local image refinement, req...
Florent Duguet, George Drettakis
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
14 years 1 months ago
A genetic algorithm for simultaneous localization and mapping
— This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. The SLAM problem is defined as a global optimization problem in which the o...
Tom Duckett
LICS
2007
IEEE
14 years 2 months ago
On Noetherian Spaces
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
Jean Goubault-Larrecq
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
13 years 12 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...