Sciweavers

374 search results - page 23 / 75
» Fast separable factorization and applications
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 9 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
UIST
2010
ACM
13 years 5 months ago
Gesture search: a tool for fast mobile data access
Modern mobile phones can store a large amount of data, such as contacts, applications and music. However, it is difficult to access specific data items via existing mobile user in...
Yang Li
ICIAR
2004
Springer
14 years 1 months ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
IJSN
2007
106views more  IJSN 2007»
13 years 7 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao