Sciweavers

943 search results - page 39 / 189
» How should data structures and algorithms be taught
Sort
View
EMMCVPR
2011
Springer
13 years 9 months ago
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
Julian John McAuley, Arnau Ramisa, Tibério ...
CIKM
2004
Springer
15 years 3 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
PLDI
1994
ACM
15 years 1 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
63
Voted
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 3 months ago
Online Hierarchical Clustering in a Data Warehouse Environment
Many important industrial applications rely on data mining methods to uncover patterns and trends in large data warehouse environments. Since a data warehouse is typically updated...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
IROS
2006
IEEE
171views Robotics» more  IROS 2006»
15 years 3 months ago
Fast central catadioptric line extraction, estimation, tracking and structure from motion
— In this paper we present an analysis of 3D line projections for central catadioptric cameras from a projective perspective. Most algorithms consider the projection of lines as ...
Christopher Mei, Ezio Malis