Sciweavers

5221 search results - page 353 / 1045
» An On-line Problem Database
Sort
View
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
16 years 26 days ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
GEOINFO
2003
15 years 8 months ago
Planning Brazilian Urban Traffic with a Geographic Application Software
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
Juliano Lopes de Oliveira, André Constantin...
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
16 years 8 months ago
HD-Eye - Visual Clustering of High dimensional Data
Clustering of large data bases is an important research area with a large variety of applications in the data base context. Missing in most of the research efforts are means for g...
Alexander Hinneburg, Daniel A. Keim, Markus Wawryn...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
AC
2000
Springer
15 years 11 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson