Sciweavers

1753 search results - page 97 / 351
» Reducibility of domain representations and Cantor-Weihrauch ...
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
ICDM
2007
IEEE
199views Data Mining» more  ICDM 2007»
14 years 3 months ago
Discovering Structural Anomalies in Graph-Based Data
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder
SEMCO
2007
IEEE
14 years 3 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
GIS
2003
ACM
14 years 10 months ago
Computational data modeling for network-constrained moving objects
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial da...
Laurynas Speicys, Christian S. Jensen, Augustas Kl...
ICPR
2008
IEEE
14 years 3 months ago
Multiscale competitive code for efficient palmprint recognition
Coding-based method, which encodes the responses of a bank of filters into bitwise features, has been very successful in palmprint representation and matching. Palmprints, however...
Wangmeng Zuo, Feng Yue, Kuanquan Wang, David Zhang