Sciweavers

702 search results - page 16 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Identifying SNPs without a Reference Genome by Comparing Raw Reads
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...
Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, ...
FSTTCS
2010
Springer
13 years 6 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
SIGIR
2008
ACM
13 years 8 months ago
Automatically identifying localizable queries
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Michael J. Welch, Junghoo Cho
RTCSA
2008
IEEE
14 years 2 months ago
Efficient Query Processing for Tracing RFID Tags by Reordering Location Identifiers
This paper addresses the problem of using the Location IDentifier (LID) as the domain value of the index for trajectories of RFID tags and proposes the solution for solving this p...
Sungwoo Ahn, Bonghee Hong
ICB
2007
Springer
238views Biometrics» more  ICB 2007»
14 years 10 days ago
Keypoint Identification and Feature-Based 3D Face Recognition
We present a feature-based 3D face recognition algorithm and propose a keypoint identification technique which is repeatable and identifies keypoints where shape variation is high ...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens