Sciweavers

66 search results - page 11 / 14
» Finding Graph Matchings in Data Streams
Sort
View
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
13 years 11 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
JCB
2006
129views more  JCB 2006»
13 years 9 months ago
GenRate: A Generative Model that Reveals Novel Transcripts in Genome-Tiling Microarray Data
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
Brendan J. Frey, Quaid Morris, Timothy R. Hughes
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
14 years 11 months ago
Group Linkage
Poor quality data is prevalent in databases due to a variety of reasons, including transcription errors, lack of standards for recording database fields, etc. To be able to query ...
Byung-Won On, Nick Koudas, Dongwon Lee, Divesh Sri...
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
14 years 1 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu
ICCV
2009
IEEE
15 years 2 months ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl