Sciweavers

5962 search results - page 750 / 1193
» Working with Patterns and Code
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
IJCV
1998
238views more  IJCV 1998»
15 years 6 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
KDD
2012
ACM
164views Data Mining» more  KDD 2012»
13 years 9 months ago
SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
Jeffrey Chan, Wei Liu, Christopher Leckie, James B...
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 8 months ago
XOntoRank: Ontology-Aware Search of Electronic Medical Records
As the use of Electronic Medical Records (EMRs) becomes more widespread, so does the need for effective information discovery within them. Recently proposed EMR standards are XML-b...
Fernando Farfán, Vagelis Hristidis, Anand R...
SIGSOFT
2007
ACM
16 years 7 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...