Sciweavers

807 search results - page 138 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
ICIP
2006
IEEE
14 years 10 months ago
Two-Stage Optimal Component Analysis
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
Yiming Wu, Xiuwen Liu, Washington Mio, Kyle A. Gal...
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 8 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
ADAEUROPE
2003
Springer
14 years 1 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 20 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...