Sciweavers

361 search results - page 34 / 73
» Finding Optimal Pairs of Patterns
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 8 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
EMNLP
2010
13 years 6 months ago
A Semi-Supervised Method to Learn and Construct Taxonomies Using the Web
Although many algorithms have been developed to harvest lexical resources, few organize the mined terms into taxonomies. We propose (1) a semi-supervised algorithm that uses a roo...
Zornitsa Kozareva, Eduard H. Hovy
MOBISYS
2005
ACM
14 years 8 months ago
Cracking the Bluetooth PIN
This paper describes the implementation of an attack on the Bluetooth security mechanism. Specifically, we describe a passive attack, in which an attacker can find the PIN used du...
Yaniv Shaked, Avishai Wool
CGF
2008
148views more  CGF 2008»
13 years 8 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker
CC
2006
Springer
125views System Software» more  CC 2006»
14 years 6 days ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...