11231 search results - page 1973 / 2247 » Digging for Data Structures |
134
Voted
CHI
2007
ACM
15 years 7 months ago
2007
ACM
Using data from a popular online social network site, this paper explores the relationship between profile structure (namely, which fields are completed) and number of friends, gi...
132
Voted
COMPSAC
2007
IEEE
15 years 7 months ago
2007
IEEE
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
149
Voted
CVPR
2007
IEEE
15 years 7 months ago
2007
IEEE
Detection of objects of a given class is important for many applications. However it is difficult to learn a general detector with high detection rate as well as low false alarm r...
126
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
139
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...