Sciweavers

198 search results - page 8 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
ICCBR
1997
Springer
14 years 17 days ago
Examining Locally Varying Weights for Nearest Neighbor Algorithms
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
Nicholas Howe, Claire Cardie
CVPR
2009
IEEE
15 years 3 months ago
Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs
In this paper, we introduce a higher-order MRF optimization framework. On the one hand, it is very general; we thus use it to derive a generic optimizer that can be applied to a...
Nikos Komodakis (University of Crete), Nikos Parag...
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
COMPGEOM
1991
ACM
13 years 12 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
JMM2
2007
118views more  JMM2 2007»
13 years 8 months ago
FPGA-based Real-time Optical Flow Algorithm Design and Implementation
—Optical flow algorithms are difficult to apply to robotic vision applications in practice because of their extremely high computational and frame rate requirements. In most case...
Zhaoyi Wei, Dah-Jye Lee, Brent E. Nelson