Sciweavers

9736 search results - page 42 / 1948
» How Fast Can We Compute Products
Sort
View
ICCV
2005
IEEE
15 years 10 months ago
Non-Orthogonal Binary Subspace and Its Applications in Computer Vision
This paper presents a novel approach that represents an image or a set of images using a nonorthogonal binary subspace (NBS) spanned by boxlike base vectors. These base vectors po...
Hai Tao, Ryan Crabb, Feng Tang
ANOR
2010
116views more  ANOR 2010»
15 years 4 months ago
A model and case study for efficient shelf usage and assortment analysis
In the rapidly changing environment of Fast Moving Consumer Goods sector where new product launches are frequent, retail channels need to reallocate their shelf spaces intelligent...
Mehmet Murat Fadiloglu, Oya Ekin Karasan, Mustafa ...
SIGSOFT
2010
ACM
15 years 2 months ago
Growth of newcomer competence: challenges of globalization
The transfer of entire projects to offshore locations, the aging and renewal of core developers in legacy products, the recruiting in fast growing Internet companies, and the part...
Minghui Zhou, Audris Mockus
ACSC
2009
IEEE
15 years 11 months ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
CIKM
2009
Springer
15 years 11 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...