Sciweavers

1887 search results - page 291 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
TJS
2002
160views more  TJS 2002»
13 years 7 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
ICDAR
2009
IEEE
13 years 5 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
RT
1998
Springer
14 years 1 days ago
Interactively Modeling with Photogrammetry
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...