Sciweavers

900 search results - page 95 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
ICPR
2006
IEEE
14 years 2 months ago
Tensor Voting Accelerated by Graphics Processing Units (GPU)
This paper presents a new GPU-based tensor voting implementation which achieves significant performance improvement over the conventional CPU-based implementation. Although the t...
Changki Min, Gérard G. Medioni
RIAO
2000
13 years 10 months ago
The Effect of Using Hierarchical Classifiers in Text Categorization
Given a set of categories, with or without a preexisting hierarchy among them, we consider the problem of assigning documents to one or more of these categories from the point of ...
Stephen D'Alessio, Keitha A. Murray, Robert Schiaf...
NJC
2000
99views more  NJC 2000»
13 years 8 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
CVPR
2007
IEEE
14 years 10 months ago
A Lagrangian Particle Dynamics Approach for Crowd Flow Segmentation and Stability Analysis
This paper proposes a framework in which Lagrangian Particle Dynamics is used for the segmentation of high density crowd flows and detection of flow instabilities. For this purpos...
Saad Ali, Mubarak Shah
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
14 years 29 days ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...