Sciweavers

2883 search results - page 157 / 577
» Algorithms for merged indexes
Sort
View
MVA
1996
15 years 7 months ago
Inductive Learning of Primitive Shape Features of Closed Contours
A method for inductivelearningof primitive features is proposed. Primitive features are well investigated and they are extracted in bottom-up manner fiom training set of patterns ...
Ichiro Murase, Shun'ichi Kaneko, Satoru Igarashi
CCP
2011
92views more  CCP 2011»
14 years 5 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
ICIP
2009
IEEE
15 years 3 months ago
A contrario hierarchical image segmentation
Hierarchies are a powerful tool for image segmentation, they produce a multiscale representation which allows to design robust algorithms and can be stored in tree-like structures...
Juan Cardelino, Vicent Caselles, Marcelo Bertalm&i...
WWW
2006
ACM
16 years 6 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
COCO
2007
Springer
92views Algorithms» more  COCO 2007»
16 years 3 days ago
Halfspace Matrices
A halfspace matrix is a Boolean matrix A with rows indexed by linear threshold functions f, columns indexed by inputs x ∈ {−1,1}n, and the entries given by Af,x = f(x). We dem...
Alexander A. Sherstov