Sciweavers

621 search results - page 44 / 125
» Global partial orders from sequential data
Sort
View
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
DAM
2007
105views more  DAM 2007»
14 years 9 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
NIPS
2008
14 years 11 months ago
Offline Handwriting Recognition with Multidimensional Recurrent Neural Networks
Offline handwriting recognition--the transcription of images of handwritten text--is an interesting task, in that it combines computer vision with sequence learning. In most syste...
Alex Graves, Jürgen Schmidhuber
ICDCS
2002
IEEE
15 years 2 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
CC
2003
Springer
15 years 3 months ago
Improving Data Locality by Chunking
Cache memories were invented to decouple fast processors from slow memories. However, this decoupling is only partial, and many researchers have attempted to improve cache use by p...
Cédric Bastoul, Paul Feautrier