6756 search results - page 1230 / 1352 » The Structure of Visual Spaces |
145
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
141
click to vote
FGR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many facial image analysis methods rely on learningbased techniques such as Adaboost or SVMs to project classifiers based on the selection of local image filters (e.g., Haar and...
144
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...
168
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
160
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...